./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 0e1a00cf 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-0e1a00c [2020-11-29 12:47:22,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 12:47:22,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 12:47:22,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 12:47:22,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 12:47:22,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 12:47:22,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 12:47:22,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 12:47:22,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 12:47:22,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 12:47:22,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 12:47:22,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 12:47:22,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 12:47:22,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 12:47:22,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 12:47:22,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 12:47:22,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 12:47:22,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 12:47:22,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 12:47:22,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 12:47:22,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 12:47:22,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 12:47:22,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 12:47:22,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 12:47:22,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 12:47:22,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 12:47:22,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 12:47:22,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 12:47:22,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 12:47:22,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 12:47:22,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 12:47:22,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 12:47:22,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 12:47:22,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 12:47:22,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 12:47:22,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 12:47:22,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 12:47:22,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 12:47:22,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 12:47:22,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 12:47:22,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 12:47:22,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 12:47:22,599 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 12:47:22,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 12:47:22,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 12:47:22,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 12:47:22,603 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 12:47:22,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 12:47:22,604 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 12:47:22,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 12:47:22,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 12:47:22,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 12:47:22,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 12:47:22,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 12:47:22,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 12:47:22,607 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 12:47:22,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 12:47:22,608 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 12:47:22,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 12:47:22,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 12:47:22,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 12:47:22,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 12:47:22,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 12:47:22,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 12:47:22,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 12:47:22,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 12:47:22,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 12:47:22,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 12:47:22,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 12:47:22,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 12:47:22,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 12:47:22,613 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-29 12:47:22,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 12:47:23,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 12:47:23,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 12:47:23,019 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 12:47:23,020 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 12:47:23,021 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-29 12:47:23,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3c4ab6f/91c724173e98473ba16367e43058d0ed/FLAGf2fd752f0 [2020-11-29 12:47:23,760 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 12:47:23,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-29 12:47:23,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3c4ab6f/91c724173e98473ba16367e43058d0ed/FLAGf2fd752f0 [2020-11-29 12:47:24,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3c4ab6f/91c724173e98473ba16367e43058d0ed [2020-11-29 12:47:24,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 12:47:24,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 12:47:24,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 12:47:24,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 12:47:24,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 12:47:24,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e1e2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24, skipping insertion in model container [2020-11-29 12:47:24,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 12:47:24,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 12:47:24,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:47:24,448 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 12:47:24,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:47:24,511 INFO L208 MainTranslator]: Completed translation [2020-11-29 12:47:24,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24 WrapperNode [2020-11-29 12:47:24,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 12:47:24,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 12:47:24,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 12:47:24,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 12:47:24,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 12:47:24,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 12:47:24,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 12:47:24,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 12:47:24,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (1/1) ... [2020-11-29 12:47:24,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 12:47:24,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 12:47:24,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 12:47:24,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 12:47:24,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (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-29 12:47:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 12:47:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 12:47:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 12:47:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 12:47:24,975 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 12:47:24,976 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-11-29 12:47:24,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:47:24 BoogieIcfgContainer [2020-11-29 12:47:24,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 12:47:24,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 12:47:24,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 12:47:24,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 12:47:24,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:47:24" (1/3) ... [2020-11-29 12:47:24,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da5a48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:47:24, skipping insertion in model container [2020-11-29 12:47:24,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:24" (2/3) ... [2020-11-29 12:47:24,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da5a48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:47:24, skipping insertion in model container [2020-11-29 12:47:24,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:47:24" (3/3) ... [2020-11-29 12:47:24,999 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-11-29 12:47:25,013 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 12:47:25,016 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 12:47:25,028 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 12:47:25,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 12:47:25,061 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 12:47:25,061 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 12:47:25,061 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 12:47:25,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 12:47:25,062 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 12:47:25,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 12:47:25,062 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 12:47:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-29 12:47:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 12:47:25,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:47:25,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 12:47:25,090 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:47:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:47:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-11-29 12:47:25,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 12:47:25,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812980925] [2020-11-29 12:47:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 12:47:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 12:47:25,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 12:47:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 12:47:25,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 12:47:25,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 12:47:25,417 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 12:47:25,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 12:47:25,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:47:25 BoogieIcfgContainer [2020-11-29 12:47:25,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 12:47:25,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 12:47:25,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 12:47:25,470 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 12:47:25,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:47:24" (3/4) ... [2020-11-29 12:47:25,476 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 12:47:25,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 12:47:25,481 INFO L168 Benchmark]: Toolchain (without parser) took 1378.32 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.9 MB in the beginning and 18.5 MB in the end (delta: -1.6 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,485 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 39.8 MB. Free memory was 26.5 MB in the beginning and 26.5 MB in the end (delta: 26.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:47:25,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.91 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 23.7 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 22.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,490 INFO L168 Benchmark]: Boogie Preprocessor took 61.92 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 32.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,491 INFO L168 Benchmark]: RCFGBuilder took 339.75 ms. Allocated memory is still 48.2 MB. Free memory was 32.8 MB in the beginning and 32.1 MB in the end (delta: 760.0 kB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,493 INFO L168 Benchmark]: TraceAbstraction took 478.47 ms. Allocated memory is still 48.2 MB. Free memory was 31.8 MB in the beginning and 19.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 12:47:25,494 INFO L168 Benchmark]: Witness Printer took 6.75 ms. Allocated memory is still 48.2 MB. Free memory was 19.0 MB in the beginning and 18.5 MB in the end (delta: 461.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:47:25,511 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.28 ms. Allocated memory is still 39.8 MB. Free memory was 26.5 MB in the beginning and 26.5 MB in the end (delta: 26.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 408.91 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 23.7 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 22.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.92 ms. Allocated memory is still 48.2 MB. Free memory was 22.1 MB in the beginning and 32.8 MB in the end (delta: -10.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 339.75 ms. Allocated memory is still 48.2 MB. Free memory was 32.8 MB in the beginning and 32.1 MB in the end (delta: 760.0 kB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 478.47 ms. Allocated memory is still 48.2 MB. Free memory was 31.8 MB in the beginning and 19.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Witness Printer took 6.75 ms. Allocated memory is still 48.2 MB. Free memory was 19.0 MB in the beginning and 18.5 MB in the end (delta: 461.9 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-0e1a00c [2020-11-29 12:47:28,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 12:47:28,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 12:47:28,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 12:47:28,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 12:47:28,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 12:47:28,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 12:47:28,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 12:47:28,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 12:47:28,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 12:47:28,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 12:47:28,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 12:47:28,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 12:47:28,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 12:47:28,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 12:47:28,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 12:47:28,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 12:47:28,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 12:47:28,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 12:47:28,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 12:47:28,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 12:47:28,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 12:47:28,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 12:47:28,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 12:47:28,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 12:47:28,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 12:47:28,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 12:47:28,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 12:47:28,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 12:47:28,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 12:47:28,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 12:47:28,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 12:47:28,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 12:47:28,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 12:47:28,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 12:47:28,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 12:47:28,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 12:47:28,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 12:47:28,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 12:47:28,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 12:47:28,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 12:47:28,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 12:47:28,229 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 12:47:28,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 12:47:28,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 12:47:28,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 12:47:28,235 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 12:47:28,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 12:47:28,235 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 12:47:28,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 12:47:28,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 12:47:28,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 12:47:28,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 12:47:28,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 12:47:28,237 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 12:47:28,237 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 12:47:28,238 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 12:47:28,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 12:47:28,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 12:47:28,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 12:47:28,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 12:47:28,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 12:47:28,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 12:47:28,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 12:47:28,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 12:47:28,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 12:47:28,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 12:47:28,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 12:47:28,241 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 12:47:28,241 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 12:47:28,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 12:47:28,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 12:47:28,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 12:47:28,242 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-29 12:47:28,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 12:47:28,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 12:47:28,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 12:47:28,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 12:47:28,671 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 12:47:28,672 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-29 12:47:28,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eba779ed/600229de19324cadb692b6ce86060dd6/FLAG38c36a93d [2020-11-29 12:47:29,385 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 12:47:29,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant.c [2020-11-29 12:47:29,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eba779ed/600229de19324cadb692b6ce86060dd6/FLAG38c36a93d [2020-11-29 12:47:29,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eba779ed/600229de19324cadb692b6ce86060dd6 [2020-11-29 12:47:29,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 12:47:29,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 12:47:29,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 12:47:29,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 12:47:29,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 12:47:29,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:47:29" (1/1) ... [2020-11-29 12:47:29,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47338005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:29, skipping insertion in model container [2020-11-29 12:47:29,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:47:29" (1/1) ... [2020-11-29 12:47:29,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 12:47:29,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 12:47:30,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:47:30,054 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 12:47:30,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 12:47:30,101 INFO L208 MainTranslator]: Completed translation [2020-11-29 12:47:30,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30 WrapperNode [2020-11-29 12:47:30,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 12:47:30,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 12:47:30,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 12:47:30,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 12:47:30,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 12:47:30,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 12:47:30,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 12:47:30,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 12:47:30,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (1/1) ... [2020-11-29 12:47:30,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 12:47:30,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 12:47:30,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 12:47:30,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 12:47:30,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (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-29 12:47:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 12:47:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 12:47:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 12:47:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 12:47:39,764 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 12:47:39,765 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-11-29 12:47:39,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:47:39 BoogieIcfgContainer [2020-11-29 12:47:39,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 12:47:39,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 12:47:39,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 12:47:39,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 12:47:39,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:47:29" (1/3) ... [2020-11-29 12:47:39,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfd84c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:47:39, skipping insertion in model container [2020-11-29 12:47:39,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:47:30" (2/3) ... [2020-11-29 12:47:39,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfd84c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:47:39, skipping insertion in model container [2020-11-29 12:47:39,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:47:39" (3/3) ... [2020-11-29 12:47:39,777 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-11-29 12:47:39,792 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 12:47:39,801 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 12:47:39,814 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 12:47:39,857 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 12:47:39,860 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 12:47:39,860 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 12:47:39,861 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 12:47:39,861 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 12:47:39,861 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 12:47:39,861 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 12:47:39,862 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 12:47:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-11-29 12:47:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 12:47:39,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:47:39,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 12:47:39,888 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:47:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:47:39,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-11-29 12:47:39,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 12:47:39,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986377224] [2020-11-29 12:47:39,908 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-29 12:47:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 12:47:41,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 12:47:41,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 12:47:41,500 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:47:41,719 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-11-29 12:47:42,034 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 3 [2020-11-29 12:47:42,045 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-29 12:47:42,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 12:47:44,316 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-29 12:47:46,389 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-29 12:47:48,413 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (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))) (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) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from false [2020-11-29 12:47:50,430 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 .cse1)))) (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))) (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) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from true [2020-11-29 12:47:50,446 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-29 12:47:50,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986377224] [2020-11-29 12:47:50,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 12:47:50,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-29 12:47:50,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398526889] [2020-11-29 12:47:50,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 12:47:50,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 12:47:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 12:47:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2020-11-29 12:47:50,502 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 8 states. [2020-11-29 12:47:54,847 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-29 12:48:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 12:48:14,850 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2020-11-29 12:48:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 12:48:14,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-11-29 12:48:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 12:48:14,864 INFO L225 Difference]: With dead ends: 39 [2020-11-29 12:48:14,865 INFO L226 Difference]: Without dead ends: 16 [2020-11-29 12:48:14,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17, Invalid=20, Unknown=5, NotChecked=30, Total=72 [2020-11-29 12:48:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-11-29 12:48:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-11-29 12:48:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 12:48:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-29 12:48:14,915 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2020-11-29 12:48:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 12:48:14,916 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-29 12:48:14,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 12:48:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-11-29 12:48:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 12:48:14,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:48:14,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 12:48:15,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 12:48:15,132 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:48:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:48:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2020-11-29 12:48:15,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 12:48:15,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755653381] [2020-11-29 12:48:15,136 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-29 12:48:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 12:48:17,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 12:48:17,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 12:48:17,441 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-29 12:48:17,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 12:48:17,750 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-29 12:48:17,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755653381] [2020-11-29 12:48:17,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 12:48:17,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 12:48:17,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356309939] [2020-11-29 12:48:17,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 12:48:17,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 12:48:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 12:48:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 12:48:17,755 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2020-11-29 12:48:18,019 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:48:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 12:48:35,914 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-11-29 12:48:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 12:48:36,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-29 12:48:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 12:48:36,111 INFO L225 Difference]: With dead ends: 27 [2020-11-29 12:48:36,112 INFO L226 Difference]: Without dead ends: 17 [2020-11-29 12:48:36,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 12:48:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-11-29 12:48:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-29 12:48:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 12:48:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-11-29 12:48:36,117 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2020-11-29 12:48:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 12:48:36,118 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-29 12:48:36,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 12:48:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-11-29 12:48:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 12:48:36,118 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:48:36,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 12:48:36,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-29 12:48:36,332 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:48:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:48:36,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2020-11-29 12:48:36,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 12:48:36,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205002887] [2020-11-29 12:48:36,335 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-29 12:48:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 12:48:39,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 12:48:39,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 12:48:39,959 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:48:40,205 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:48:40,516 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-11-29 12:48:40,862 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-29 12:48:41,296 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-11-29 12:48:41,709 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 5 [2020-11-29 12:48:41,713 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-29 12:48:41,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 12:48:42,314 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-29 12:48:44,528 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-29 12:48:46,722 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-29 12:48:49,261 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-29 12:48:51,825 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-29 12:48:54,162 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-29 12:48:56,529 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-29 12:48:58,880 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-29 12:49:01,213 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-29 12:49:01,263 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-29 12:49:01,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205002887] [2020-11-29 12:49:01,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 12:49:01,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-29 12:49:01,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020082318] [2020-11-29 12:49:01,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 12:49:01,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 12:49:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 12:49:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=83, Unknown=8, NotChecked=84, Total=210 [2020-11-29 12:49:01,268 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 15 states. [2020-11-29 12:49:06,170 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-29 12:49:08,497 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-29 12:49:10,866 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-29 12:49:13,231 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-29 12:49:15,861 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-29 12:49:18,110 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-29 12:49:20,330 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 (= 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 true [2020-11-29 12:49:34,192 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-29 12:49:44,746 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-29 12:50:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 12:50:07,543 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-11-29 12:50:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 12:50:07,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2020-11-29 12:50:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 12:50:07,549 INFO L225 Difference]: With dead ends: 27 [2020-11-29 12:50:07,549 INFO L226 Difference]: Without dead ends: 25 [2020-11-29 12:50:07,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=56, Invalid=117, Unknown=15, NotChecked=232, Total=420 [2020-11-29 12:50:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-29 12:50:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-11-29 12:50:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-29 12:50:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-29 12:50:07,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2020-11-29 12:50:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 12:50:07,557 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-29 12:50:07,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 12:50:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-29 12:50:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 12:50:07,557 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 12:50:07,558 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 12:50:07,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-29 12:50:07,771 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 12:50:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 12:50:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2020-11-29 12:50:07,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 12:50:07,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759566593] [2020-11-29 12:50:07,774 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-29 12:50:12,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 12:50:12,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 12:50:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-29 12:50:13,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 12:50:13,547 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:50:13,795 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-29 12:50:14,119 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-11-29 12:50:16,465 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xn~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (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 .cse0) .cse0) (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) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (= c_ULTIMATE.start_SqrtR_~Input .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-29 12:50:16,936 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 12:50:19,612 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 12:50:20,037 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 5 [2020-11-29 12:50:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-11-29 12:50:20,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 12:50:20,736 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-29 12:50:22,945 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-29 12:50:26,753 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-29 12:50:29,356 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-29 12:50:32,824 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-29 12:50:36,076 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-29 12:50:38,731 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-29 12:50:41,387 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-29 12:50:44,040 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-29 12:50:46,705 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-29 12:50:46,798 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-29 12:50:46,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759566593] [2020-11-29 12:50:46,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 12:50:46,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-11-29 12:50:46,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851207635] [2020-11-29 12:50:46,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-29 12:50:46,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 12:50:46,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 12:50:46,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=84, Unknown=11, NotChecked=138, Total=272 [2020-11-29 12:50:46,801 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 17 states. [2020-11-29 12:50:52,574 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-29 12:50:55,300 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-29 12:50:57,980 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-29 12:51:00,659 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-29 12:51:04,105 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)) (= c_ULTIMATE.start_SqrtR_~xn~0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 .cse1)))) is different from false [2020-11-29 12:51:06,259 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-29 12:51:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 12:51:06,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-29 12:51:06,465 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:851) 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-29 12:51:06,474 INFO L168 Benchmark]: Toolchain (without parser) took 216711.94 ms. Allocated memory was 44.0 MB in the beginning and 58.7 MB in the end (delta: 14.7 MB). Free memory was 20.7 MB in the beginning and 39.2 MB in the end (delta: -18.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:51:06,475 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 44.0 MB. Free memory is still 23.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:51:06,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.61 ms. Allocated memory is still 58.7 MB. Free memory was 43.9 MB in the beginning and 33.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 12:51:06,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.29 ms. Allocated memory is still 58.7 MB. Free memory was 33.2 MB in the beginning and 31.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:51:06,477 INFO L168 Benchmark]: Boogie Preprocessor took 37.85 ms. Allocated memory is still 58.7 MB. Free memory was 31.5 MB in the beginning and 30.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:51:06,478 INFO L168 Benchmark]: RCFGBuilder took 9573.72 ms. Allocated memory is still 58.7 MB. Free memory was 30.2 MB in the beginning and 32.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-11-29 12:51:06,479 INFO L168 Benchmark]: TraceAbstraction took 206703.63 ms. Allocated memory is still 58.7 MB. Free memory was 31.6 MB in the beginning and 39.2 MB in the end (delta: -7.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 12:51:06,483 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.26 ms. Allocated memory is still 44.0 MB. Free memory is still 23.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 308.61 ms. Allocated memory is still 58.7 MB. Free memory was 43.9 MB in the beginning and 33.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.29 ms. Allocated memory is still 58.7 MB. Free memory was 33.2 MB in the beginning and 31.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.85 ms. Allocated memory is still 58.7 MB. Free memory was 31.5 MB in the beginning and 30.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 9573.72 ms. Allocated memory is still 58.7 MB. Free memory was 30.2 MB in the beginning and 32.0 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 206703.63 ms. Allocated memory is still 58.7 MB. Free memory was 31.6 MB in the beginning and 39.2 MB in the end (delta: -7.6 MB). There was no memory consumed. 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...