./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cbb939d5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce03bf6872f0cdac7da47b07acbc22acdd73caa8 .......................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce03bf6872f0cdac7da47b07acbc22acdd73caa8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-cbb939d [2020-11-23 15:56:41,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 15:56:41,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 15:56:41,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 15:56:41,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 15:56:41,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 15:56:41,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 15:56:41,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 15:56:41,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 15:56:41,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 15:56:41,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 15:56:41,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 15:56:41,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 15:56:41,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 15:56:41,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 15:56:41,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 15:56:41,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 15:56:41,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 15:56:41,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 15:56:41,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 15:56:41,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 15:56:41,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 15:56:41,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 15:56:41,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 15:56:41,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 15:56:41,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 15:56:41,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 15:56:41,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 15:56:41,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 15:56:41,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 15:56:41,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 15:56:41,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 15:56:41,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 15:56:41,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 15:56:41,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 15:56:41,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 15:56:41,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 15:56:41,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 15:56:41,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 15:56:41,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 15:56:41,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 15:56:41,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 15:56:41,528 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 15:56:41,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 15:56:41,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 15:56:41,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 15:56:41,533 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 15:56:41,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 15:56:41,533 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 15:56:41,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 15:56:41,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 15:56:41,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 15:56:41,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 15:56:41,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 15:56:41,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 15:56:41,536 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 15:56:41,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 15:56:41,537 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 15:56:41,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 15:56:41,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 15:56:41,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 15:56:41,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 15:56:41,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 15:56:41,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 15:56:41,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 15:56:41,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 15:56:41,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 15:56:41,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 15:56:41,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 15:56:41,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 15:56:41,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 15:56:41,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> ce03bf6872f0cdac7da47b07acbc22acdd73caa8 [2020-11-23 15:56:41,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 15:56:41,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 15:56:41,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 15:56:41,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 15:56:41,989 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 15:56:41,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-23 15:56:42,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c15cc37/528b85634b4a4a3daf8c97cae21fa7a2/FLAG2949ea175 [2020-11-23 15:56:42,695 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 15:56:42,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-23 15:56:42,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c15cc37/528b85634b4a4a3daf8c97cae21fa7a2/FLAG2949ea175 [2020-11-23 15:56:43,064 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c15cc37/528b85634b4a4a3daf8c97cae21fa7a2 [2020-11-23 15:56:43,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 15:56:43,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 15:56:43,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 15:56:43,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 15:56:43,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 15:56:43,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264ef112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43, skipping insertion in model container [2020-11-23 15:56:43,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 15:56:43,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 15:56:43,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 15:56:43,348 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 15:56:43,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 15:56:43,390 INFO L208 MainTranslator]: Completed translation [2020-11-23 15:56:43,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43 WrapperNode [2020-11-23 15:56:43,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 15:56:43,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 15:56:43,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 15:56:43,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 15:56:43,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 15:56:43,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 15:56:43,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 15:56:43,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 15:56:43,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... [2020-11-23 15:56:43,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 15:56:43,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 15:56:43,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 15:56:43,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 15:56:43,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:56:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 15:56:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 15:56:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 15:56:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 15:56:43,811 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 15:56:43,812 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-11-23 15:56:43,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:43 BoogieIcfgContainer [2020-11-23 15:56:43,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 15:56:43,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 15:56:43,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 15:56:43,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 15:56:43,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:43" (1/3) ... [2020-11-23 15:56:43,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdce153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:43, skipping insertion in model container [2020-11-23 15:56:43,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:43" (2/3) ... [2020-11-23 15:56:43,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdce153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:43, skipping insertion in model container [2020-11-23 15:56:43,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:43" (3/3) ... [2020-11-23 15:56:43,834 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-11-23 15:56:43,853 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 15:56:43,857 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 15:56:43,874 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 15:56:43,912 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 15:56:43,913 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 15:56:43,913 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 15:56:43,913 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 15:56:43,913 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 15:56:43,914 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 15:56:43,914 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 15:56:43,914 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 15:56:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-23 15:56:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 15:56:43,965 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 15:56:43,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 15:56:43,967 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 15:56:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 15:56:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-11-23 15:56:44,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 15:56:44,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689637492] [2020-11-23 15:56:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 15:56:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 15:56:44,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 15:56:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 15:56:44,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 15:56:44,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 15:56:44,241 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 15:56:44,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 15:56:44,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:56:44 BoogieIcfgContainer [2020-11-23 15:56:44,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 15:56:44,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 15:56:44,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 15:56:44,277 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 15:56:44,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:43" (3/4) ... [2020-11-23 15:56:44,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 15:56:44,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 15:56:44,290 INFO L168 Benchmark]: Toolchain (without parser) took 1216.07 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 24.1 MB in the beginning and 27.5 MB in the end (delta: -3.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,291 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 46.1 MB. Free memory was 33.5 MB in the beginning and 33.5 MB in the end (delta: 38.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 15:56:44,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.37 ms. Allocated memory is still 46.1 MB. Free memory was 23.5 MB in the beginning and 24.6 MB in the end (delta: -1.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.14 ms. Allocated memory is still 46.1 MB. Free memory was 24.6 MB in the beginning and 23.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,295 INFO L168 Benchmark]: Boogie Preprocessor took 29.34 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 21.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,296 INFO L168 Benchmark]: RCFGBuilder took 355.65 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.8 MB in the beginning and 41.0 MB in the end (delta: -19.2 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,300 INFO L168 Benchmark]: TraceAbstraction took 451.13 ms. Allocated memory is still 56.6 MB. Free memory was 40.7 MB in the beginning and 27.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-23 15:56:44,301 INFO L168 Benchmark]: Witness Printer took 9.55 ms. Allocated memory is still 56.6 MB. Free memory was 27.9 MB in the beginning and 27.5 MB in the end (delta: 468.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 15:56:44,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 46.1 MB. Free memory was 33.5 MB in the beginning and 33.5 MB in the end (delta: 38.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 313.37 ms. Allocated memory is still 46.1 MB. Free memory was 23.5 MB in the beginning and 24.6 MB in the end (delta: -1.1 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.14 ms. Allocated memory is still 46.1 MB. Free memory was 24.6 MB in the beginning and 23.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.34 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 21.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 355.65 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.8 MB in the beginning and 41.0 MB in the end (delta: -19.2 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 451.13 ms. Allocated memory is still 56.6 MB. Free memory was 40.7 MB in the beginning and 27.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Witness Printer took 9.55 ms. Allocated memory is still 56.6 MB. Free memory was 27.9 MB in the beginning and 27.5 MB in the end (delta: 468.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000] [L51] COND TRUE d <= 20. [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [_EPS=1/1000000] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [_EPS=1/1000000] [L35] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L44] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L53] r = SqrtR(d) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L3] __assert_fail("0", "sqrt_Householder_constant.c", 3, "reach_error") VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: 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.2.0-cbb939d [2020-11-23 15:56:46,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 15:56:46,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 15:56:46,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 15:56:46,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 15:56:46,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 15:56:46,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 15:56:46,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 15:56:46,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 15:56:46,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 15:56:46,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 15:56:46,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 15:56:46,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 15:56:46,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 15:56:46,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 15:56:46,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 15:56:46,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 15:56:46,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 15:56:46,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 15:56:46,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 15:56:46,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 15:56:46,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 15:56:46,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 15:56:47,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 15:56:47,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 15:56:47,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 15:56:47,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 15:56:47,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 15:56:47,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 15:56:47,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 15:56:47,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 15:56:47,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 15:56:47,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 15:56:47,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 15:56:47,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 15:56:47,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 15:56:47,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 15:56:47,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 15:56:47,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 15:56:47,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 15:56:47,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 15:56:47,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 15:56:47,098 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 15:56:47,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 15:56:47,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 15:56:47,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 15:56:47,102 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 15:56:47,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 15:56:47,102 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 15:56:47,103 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 15:56:47,104 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 15:56:47,104 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 15:56:47,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 15:56:47,104 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 15:56:47,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 15:56:47,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 15:56:47,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 15:56:47,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 15:56:47,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 15:56:47,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 15:56:47,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 15:56:47,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 15:56:47,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 15:56:47,108 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 15:56:47,108 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 15:56:47,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 15:56:47,108 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 15:56:47,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 15:56:47,109 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> ce03bf6872f0cdac7da47b07acbc22acdd73caa8 [2020-11-23 15:56:47,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 15:56:47,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 15:56:47,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 15:56:47,610 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 15:56:47,611 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 15:56:47,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-23 15:56:47,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab29efe71/33f0a0edcb76467393ec32f3ab7363e8/FLAG51eb58491 [2020-11-23 15:56:48,278 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 15:56:48,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-23 15:56:48,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab29efe71/33f0a0edcb76467393ec32f3ab7363e8/FLAG51eb58491 [2020-11-23 15:56:48,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab29efe71/33f0a0edcb76467393ec32f3ab7363e8 [2020-11-23 15:56:48,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 15:56:48,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 15:56:48,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 15:56:48,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 15:56:48,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 15:56:48,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:48,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5c1a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48, skipping insertion in model container [2020-11-23 15:56:48,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:48,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 15:56:48,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 15:56:48,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 15:56:48,950 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 15:56:48,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 15:56:48,997 INFO L208 MainTranslator]: Completed translation [2020-11-23 15:56:48,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48 WrapperNode [2020-11-23 15:56:48,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 15:56:49,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 15:56:49,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 15:56:49,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 15:56:49,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 15:56:49,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 15:56:49,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 15:56:49,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 15:56:49,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... [2020-11-23 15:56:49,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 15:56:49,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 15:56:49,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 15:56:49,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 15:56:49,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:56:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 15:56:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 15:56:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 15:56:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 15:56:59,044 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 15:56:59,044 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-11-23 15:56:59,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:59 BoogieIcfgContainer [2020-11-23 15:56:59,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 15:56:59,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 15:56:59,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 15:56:59,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 15:56:59,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:56:48" (1/3) ... [2020-11-23 15:56:59,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6d3f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:59, skipping insertion in model container [2020-11-23 15:56:59,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:56:48" (2/3) ... [2020-11-23 15:56:59,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6d3f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:56:59, skipping insertion in model container [2020-11-23 15:56:59,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:56:59" (3/3) ... [2020-11-23 15:56:59,063 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-11-23 15:56:59,080 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 15:56:59,084 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 15:56:59,098 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 15:56:59,126 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 15:56:59,127 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 15:56:59,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 15:56:59,127 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 15:56:59,127 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 15:56:59,127 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 15:56:59,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 15:56:59,128 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 15:56:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-23 15:56:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 15:56:59,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 15:56:59,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 15:56:59,150 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 15:56:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 15:56:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-11-23 15:56:59,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 15:56:59,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686414144] [2020-11-23 15:56:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:57:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 15:57:00,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-23 15:57:00,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 15:57:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 15:57:01,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 15:57:03,245 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from false [2020-11-23 15:57:05,381 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from true [2020-11-23 15:57:13,135 WARN L194 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2020-11-23 15:57:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 15:57:13,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686414144] [2020-11-23 15:57:13,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 15:57:13,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-23 15:57:13,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956597163] [2020-11-23 15:57:13,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-23 15:57:13,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 15:57:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-23 15:57:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2020-11-23 15:57:13,166 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 8 states. [2020-11-23 15:57:15,380 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_SqrtR_~xn~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from true [2020-11-23 15:57:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 15:57:42,561 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2020-11-23 15:57:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 15:57:42,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-11-23 15:57:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 15:57:42,688 INFO L225 Difference]: With dead ends: 40 [2020-11-23 15:57:42,688 INFO L226 Difference]: Without dead ends: 17 [2020-11-23 15:57:42,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2020-11-23 15:57:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-23 15:57:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-23 15:57:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-23 15:57:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-23 15:57:42,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2020-11-23 15:57:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 15:57:42,729 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-23 15:57:42,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-23 15:57:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-11-23 15:57:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 15:57:42,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 15:57:42,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 15:57:42,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 15:57:42,932 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 15:57:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 15:57:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2020-11-23 15:57:42,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 15:57:42,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697711923] [2020-11-23 15:57:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:57:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 15:57:45,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 15:57:45,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 15:57:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 15:57:45,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 15:57:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 15:57:45,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697711923] [2020-11-23 15:57:45,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 15:57:45,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-23 15:57:45,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671085845] [2020-11-23 15:57:45,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-23 15:57:45,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 15:57:45,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-23 15:57:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-23 15:57:45,288 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2020-11-23 15:57:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 15:57:58,502 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-11-23 15:57:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 15:57:58,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-23 15:57:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 15:57:58,896 INFO L225 Difference]: With dead ends: 27 [2020-11-23 15:57:58,896 INFO L226 Difference]: Without dead ends: 17 [2020-11-23 15:57:58,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-23 15:57:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-23 15:57:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-23 15:57:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-23 15:57:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-11-23 15:57:58,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2020-11-23 15:57:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 15:57:58,902 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-23 15:57:58,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-23 15:57:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-11-23 15:57:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-23 15:57:58,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 15:57:58,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 15:57:59,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 15:57:59,115 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 15:57:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 15:57:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2020-11-23 15:57:59,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 15:57:59,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872210061] [2020-11-23 15:57:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:58:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 15:58:02,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-23 15:58:02,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 15:58:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 15:58:03,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 15:58:05,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:58:10,037 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:58:12,873 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 15:58:15,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:58:17,994 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 15:58:20,564 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 15:58:23,132 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 15:58:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-23 15:58:23,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872210061] [2020-11-23 15:58:23,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 15:58:23,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-23 15:58:23,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928901234] [2020-11-23 15:58:23,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-23 15:58:23,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 15:58:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-23 15:58:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=84, Unknown=7, NotChecked=84, Total=210 [2020-11-23 15:58:23,178 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 15 states. [2020-11-23 15:58:28,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 15:58:30,719 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 15:58:33,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:58:35,905 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 15:58:38,778 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (= c_ULTIMATE.start_SqrtR_~xn~0 .cse0) (= c_ULTIMATE.start_SqrtR_~Input .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2020-11-23 15:58:41,231 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) c_ULTIMATE.start_SqrtR_~xnp1~0) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:59:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 15:59:15,940 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-11-23 15:59:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-23 15:59:16,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2020-11-23 15:59:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 15:59:16,349 INFO L225 Difference]: With dead ends: 26 [2020-11-23 15:59:16,349 INFO L226 Difference]: Without dead ends: 24 [2020-11-23 15:59:16,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=56, Invalid=119, Unknown=13, NotChecked=232, Total=420 [2020-11-23 15:59:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-23 15:59:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-11-23 15:59:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-23 15:59:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-23 15:59:16,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2020-11-23 15:59:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 15:59:16,358 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-23 15:59:16,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-23 15:59:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-23 15:59:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 15:59:16,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 15:59:16,359 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 15:59:16,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 15:59:16,575 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 15:59:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 15:59:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2020-11-23 15:59:16,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 15:59:16,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761123959] [2020-11-23 15:59:16,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-23 15:59:22,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-23 15:59:22,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 15:59:22,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-23 15:59:22,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 15:59:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-23 15:59:25,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 15:59:27,818 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:59:30,216 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 15:59:33,124 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 15:59:36,031 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 16:00:15,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-11-23 16:01:04,915 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-11-23 16:01:28,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 16:01:47,475 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 16:02:11,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 16:02:31,435 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 16:02:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-23 16:02:31,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761123959] [2020-11-23 16:02:31,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:02:31,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2020-11-23 16:02:31,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562387077] [2020-11-23 16:02:31,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-23 16:02:31,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:02:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-23 16:02:31,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=83, Unknown=10, NotChecked=110, Total=240 [2020-11-23 16:02:31,507 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2020-11-23 16:03:07,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 16:03:36,208 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 16:03:57,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-11-23 16:04:19,823 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-11-23 16:04:49,653 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-23 16:04:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 16:04:49,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-23 16:04:49,856 FATAL L? ?]: 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:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) 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:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-11-23 16:04:49,862 INFO L168 Benchmark]: Toolchain (without parser) took 481218.00 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.4 MB in the beginning and 34.0 MB in the end (delta: -10.6 MB). Peak memory consumption was 2.0 MB. Max. memory is 16.1 GB. [2020-11-23 16:04:49,863 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory was 29.0 MB in the beginning and 28.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:04:49,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.76 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:04:49,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.84 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 19.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:04:49,866 INFO L168 Benchmark]: Boogie Preprocessor took 41.86 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 40.6 MB in the end (delta: -21.0 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-11-23 16:04:49,867 INFO L168 Benchmark]: RCFGBuilder took 9955.10 ms. Allocated memory is still 56.6 MB. Free memory was 40.6 MB in the beginning and 27.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-23 16:04:49,868 INFO L168 Benchmark]: TraceAbstraction took 470805.04 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 34.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:04:49,879 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory was 29.0 MB in the beginning and 28.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 345.76 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.84 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 19.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.86 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 40.6 MB in the end (delta: -21.0 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9955.10 ms. Allocated memory is still 56.6 MB. Free memory was 40.6 MB in the beginning and 27.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 470805.04 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 34.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 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:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...