./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_loose.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_loose.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 4ffcfb5240555d68939cfa296fd9345209c9c26c ............................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_loose.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 4ffcfb5240555d68939cfa296fd9345209c9c26c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:47:28,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:47:28,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:47:28,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:47:28,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:47:28,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:47:28,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:47:28,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:47:28,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:47:28,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:47:28,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:47:28,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:47:28,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:47:28,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:47:28,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:47:28,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:47:28,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:47:28,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:47:28,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:47:28,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:47:28,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:47:28,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:47:28,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:47:28,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:47:28,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:47:28,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:47:28,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:47:28,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:47:28,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:47:28,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:47:28,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:47:28,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:47:28,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:47:28,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:47:28,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:47:28,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:47:28,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:47:28,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:47:28,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:47:28,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:47:28,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:47:28,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 14:47:28,690 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:47:28,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:47:28,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:47:28,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:47:28,695 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:47:28,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:47:28,696 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:47:28,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 14:47:28,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:47:28,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:47:28,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:47:28,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:47:28,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:47:28,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:47:28,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:47:28,699 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:47:28,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:47:28,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:47:28,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:47:28,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:47:28,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:47:28,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:28,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:47:28,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:47:28,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:47:28,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 14:47:28,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 14:47:28,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:47:28,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:47:28,705 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-2/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-2/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 -> 4ffcfb5240555d68939cfa296fd9345209c9c26c [2020-10-24 14:47:29,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:47:29,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:47:29,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:47:29,269 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:47:29,270 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:47:29,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_loose.c [2020-10-24 14:47:29,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a42822a2e/4926c2d420ea436f996f04619ecc4a0a/FLAGe12ec17e8 [2020-10-24 14:47:30,070 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:47:30,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_loose.c [2020-10-24 14:47:30,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a42822a2e/4926c2d420ea436f996f04619ecc4a0a/FLAGe12ec17e8 [2020-10-24 14:47:30,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a42822a2e/4926c2d420ea436f996f04619ecc4a0a [2020-10-24 14:47:30,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:47:30,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:47:30,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:30,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:47:30,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:47:30,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed826a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30, skipping insertion in model container [2020-10-24 14:47:30,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,438 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:47:30,454 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:47:30,695 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:30,708 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:47:30,727 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:30,744 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:47:30,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30 WrapperNode [2020-10-24 14:47:30,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:30,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:30,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:47:30,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:47:30,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:30,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:47:30,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:47:30,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:47:30,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... [2020-10-24 14:47:30,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:47:30,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:47:30,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:47:30,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:47:30,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:47:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 14:47:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:47:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:47:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:47:31,145 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:47:31,146 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 14:47:31,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:31 BoogieIcfgContainer [2020-10-24 14:47:31,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:47:31,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:47:31,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:47:31,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:47:31,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:47:30" (1/3) ... [2020-10-24 14:47:31,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f69e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:31, skipping insertion in model container [2020-10-24 14:47:31,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:30" (2/3) ... [2020-10-24 14:47:31,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f69e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:31, skipping insertion in model container [2020-10-24 14:47:31,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:31" (3/3) ... [2020-10-24 14:47:31,160 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c [2020-10-24 14:47:31,174 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:47:31,185 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:47:31,224 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:47:31,298 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:47:31,298 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:47:31,299 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:47:31,299 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:47:31,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:47:31,300 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:47:31,300 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:47:31,300 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:47:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-24 14:47:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:47:31,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:31,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:31,332 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2020-10-24 14:47:31,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:47:31,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946032036] [2020-10-24 14:47:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:47:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:47:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:47:31,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946032036] [2020-10-24 14:47:31,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:47:31,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 14:47:31,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232255464] [2020-10-24 14:47:31,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:47:31,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 14:47:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:47:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:47:31,619 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-24 14:47:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:47:31,642 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-10-24 14:47:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:47:31,644 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-24 14:47:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:47:31,656 INFO L225 Difference]: With dead ends: 24 [2020-10-24 14:47:31,657 INFO L226 Difference]: Without dead ends: 9 [2020-10-24 14:47:31,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:47:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-24 14:47:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-24 14:47:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-24 14:47:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-10-24 14:47:31,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2020-10-24 14:47:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:47:31,723 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-10-24 14:47:31,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:47:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-10-24 14:47:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:47:31,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:31,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:31,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 14:47:31,726 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:31,732 INFO L82 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2020-10-24 14:47:31,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:47:31,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130924211] [2020-10-24 14:47:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:47:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:47:31,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:47:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:47:31,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:47:31,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 14:47:31,904 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 14:47:31,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 14:47:31,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:47:31 BoogieIcfgContainer [2020-10-24 14:47:31,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:47:31,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:47:31,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:47:31,951 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:47:31,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:31" (3/4) ... [2020-10-24 14:47:31,956 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:47:31,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:47:31,963 INFO L168 Benchmark]: Toolchain (without parser) took 1546.10 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.5 MB in the beginning and 23.1 MB in the end (delta: -1.6 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:31,964 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 44.0 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:31,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.96 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 22.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:31,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 44.0 MB. Free memory was 22.3 MB in the beginning and 20.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:31,969 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 20.0 MB in the end (delta: 928.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:31,971 INFO L168 Benchmark]: RCFGBuilder took 325.04 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 19.9 MB in the beginning and 29.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:31,973 INFO L168 Benchmark]: TraceAbstraction took 798.93 ms. Allocated memory is still 54.5 MB. Free memory was 29.2 MB in the beginning and 23.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:31,974 INFO L168 Benchmark]: Witness Printer took 7.26 ms. Allocated memory is still 54.5 MB. Free memory was 23.3 MB in the beginning and 23.1 MB in the end (delta: 265.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:31,992 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.37 ms. Allocated memory is still 44.0 MB. Free memory was 30.5 MB in the beginning and 30.5 MB in the end (delta: 22.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 326.96 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 22.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 44.0 MB. Free memory was 22.3 MB in the beginning and 20.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 44.0 MB. Free memory was 20.9 MB in the beginning and 20.0 MB in the end (delta: 928.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 325.04 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 19.9 MB in the beginning and 29.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 798.93 ms. Allocated memory is still 54.5 MB. Free memory was 29.2 MB in the beginning and 23.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Witness Printer took 7.26 ms. Allocated memory is still 54.5 MB. Free memory was 23.3 MB in the beginning and 23.1 MB in the end (delta: 265.6 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 someBinaryArithmeticDOUBLE_SMToperation at line 24, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 27. Possible FailurePath: [L18] double x,y; [L20] x = __VERIFIER_nondet_double() [L12] COND FALSE !(!cond) [L23] y = x*x - x [L24] COND TRUE y >= 0 [L24] y = x / 10. [L14] COND TRUE !(cond) [L3] __assert_fail("0", "zonotope_loose.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-ee8e70e [2020-10-24 14:47:34,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:47:34,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:47:34,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:47:34,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:47:34,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:47:34,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:47:34,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:47:34,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:47:34,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:47:34,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:47:34,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:47:34,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:47:34,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:47:34,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:47:34,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:47:34,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:47:34,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:47:34,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:47:34,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:47:34,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:47:34,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:47:34,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:47:35,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:47:35,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:47:35,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:47:35,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:47:35,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:47:35,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:47:35,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:47:35,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:47:35,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:47:35,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:47:35,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:47:35,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:47:35,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:47:35,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:47:35,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:47:35,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:47:35,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:47:35,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:47:35,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 14:47:35,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:47:35,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:47:35,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:47:35,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:47:35,112 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:47:35,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:47:35,112 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:47:35,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:47:35,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:47:35,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:47:35,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:47:35,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:47:35,124 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 14:47:35,124 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 14:47:35,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:47:35,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:47:35,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:47:35,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:47:35,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:47:35,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:47:35,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:47:35,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:47:35,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:35,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:47:35,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:47:35,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:47:35,130 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 14:47:35,131 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 14:47:35,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:47:35,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:47:35,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 14:47:35,132 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-2/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-2/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 -> 4ffcfb5240555d68939cfa296fd9345209c9c26c [2020-10-24 14:47:35,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:47:35,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:47:35,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:47:35,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:47:35,559 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:47:35,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_loose.c [2020-10-24 14:47:35,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc6fa9a7e/a7d0295caa0f41a3bada6507281492e4/FLAG25a728e55 [2020-10-24 14:47:36,365 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:47:36,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_loose.c [2020-10-24 14:47:36,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc6fa9a7e/a7d0295caa0f41a3bada6507281492e4/FLAG25a728e55 [2020-10-24 14:47:36,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc6fa9a7e/a7d0295caa0f41a3bada6507281492e4 [2020-10-24 14:47:36,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:47:36,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:47:36,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:36,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:47:36,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:47:36,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:36" (1/1) ... [2020-10-24 14:47:36,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd6459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:36, skipping insertion in model container [2020-10-24 14:47:36,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:36" (1/1) ... [2020-10-24 14:47:36,766 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:47:36,791 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:47:37,037 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:37,055 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:47:37,075 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:37,095 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:47:37,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37 WrapperNode [2020-10-24 14:47:37,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:37,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:37,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:47:37,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:47:37,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:37,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:47:37,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:47:37,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:47:37,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... [2020-10-24 14:47:37,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:47:37,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:47:37,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:47:37,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:47:37,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:47:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 14:47:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 14:47:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:47:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:47:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:47:40,840 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:47:40,840 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 14:47:40,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:40 BoogieIcfgContainer [2020-10-24 14:47:40,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:47:40,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:47:40,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:47:40,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:47:40,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:47:36" (1/3) ... [2020-10-24 14:47:40,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7086ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:40, skipping insertion in model container [2020-10-24 14:47:40,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:37" (2/3) ... [2020-10-24 14:47:40,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7086ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:40, skipping insertion in model container [2020-10-24 14:47:40,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:40" (3/3) ... [2020-10-24 14:47:40,855 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c [2020-10-24 14:47:40,868 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:47:40,873 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:47:40,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:47:40,916 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:47:40,917 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:47:40,917 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:47:40,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:47:40,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:47:40,918 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:47:40,918 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:47:40,918 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:47:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-10-24 14:47:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:47:40,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:40,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:40,943 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1657916917, now seen corresponding path program 1 times [2020-10-24 14:47:40,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:47:40,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605826965] [2020-10-24 14:47:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:47:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:47:42,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 14:47:42,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:47:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:47:42,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:47:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:47:42,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605826965] [2020-10-24 14:47:42,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:47:42,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 14:47:42,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494822520] [2020-10-24 14:47:42,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:47:42,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:47:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:47:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:47:42,608 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-10-24 14:47:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:47:42,627 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-24 14:47:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:47:42,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-10-24 14:47:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:47:42,638 INFO L225 Difference]: With dead ends: 30 [2020-10-24 14:47:42,639 INFO L226 Difference]: Without dead ends: 13 [2020-10-24 14:47:42,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:47:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-10-24 14:47:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-24 14:47:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-24 14:47:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-10-24 14:47:42,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2020-10-24 14:47:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:47:42,680 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-24 14:47:42,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:47:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-10-24 14:47:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:47:42,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:42,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:42,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 14:47:42,894 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash 848570291, now seen corresponding path program 1 times [2020-10-24 14:47:42,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:47:42,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234829767] [2020-10-24 14:47:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:47:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:47:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-24 14:47:44,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:47:44,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:47:44,772 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 14:47:44,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:47:45,054 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-24 14:47:45,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:47:47,528 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse0 .cse2))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-10-24 14:47:49,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse0 .cse2))))) (= roundNearestTiesToEven c_~CRM)) is different from true [2020-10-24 14:47:49,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:47:51,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse7 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse4 .cse5) (= .cse6 .cse7) (= .cse5 .cse7) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse4 .cse6)))))) (.cse1 (= roundNearestTiesToEven c_~CRM))) (or (and (not |c_ULTIMATE.start_main_#t~short20|) .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (_ +zero 11 53) .cse2) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse2)))))) (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse3) (= (_ +zero 11 53) .cse3)))) .cse1 |c_ULTIMATE.start_main_#t~short20|))) is different from false [2020-10-24 14:47:51,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:47:57,920 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse0)) (= (_ +zero 11 53) .cse5) (= .cse6 .cse2))))) |c_ULTIMATE.start_main_#t~short20|) is different from false [2020-10-24 14:48:00,025 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse0)) (= (_ +zero 11 53) .cse5) (= .cse6 .cse2))))) |c_ULTIMATE.start_main_#t~short20|) is different from true [2020-10-24 14:48:00,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:08,717 WARN L838 $PredicateComparison]: unable to prove that (or (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse0)) (= (_ +zero 11 53) .cse5) (= .cse6 .cse2)))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-10-24 14:48:15,240 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse0)) (= (_ +zero 11 53) .cse5) (= .cse6 .cse2)))) is different from false [2020-10-24 14:48:17,326 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse0)) (= (_ +zero 11 53) .cse5) (= .cse6 .cse2)))) is different from true [2020-10-24 14:48:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:17,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:48:20,285 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0)))))) is different from true [2020-10-24 14:48:22,561 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from true [2020-10-24 14:48:22,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:48:22,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:48:24,820 WARN L860 $PredicateComparison]: unable to prove that (or (not |c_ULTIMATE.start_main_#t~short10|) (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from true [2020-10-24 14:48:26,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2))))) is different from false [2020-10-24 14:48:29,171 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2))))) is different from true [2020-10-24 14:48:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:29,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234829767] [2020-10-24 14:48:29,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:48:29,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2020-10-24 14:48:29,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173943759] [2020-10-24 14:48:29,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 14:48:29,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:48:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 14:48:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=75, Unknown=13, NotChecked=216, Total=342 [2020-10-24 14:48:29,192 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 19 states. [2020-10-24 14:48:31,413 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2)))))) is different from false [2020-10-24 14:48:48,311 WARN L193 SmtUtils]: Spent 11.83 s on a formula simplification that was a NOOP. DAG size: 66 [2020-10-24 14:48:50,628 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse5 (= roundNearestTiesToEven c_~CRM)) (.cse6 (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse9) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse9))))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse1)) (not (fp.geq .cse2 .cse1)) (not (= .cse2 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse4)) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0))))))) (or (and .cse5 .cse6 .cse0) (and .cse5 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (exists ((v_prenex_1 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse7) (= .cse7 ((_ to_fp 11 53) c_~CRM 10.0))))))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse8)))) .cse5 |c_ULTIMATE.start_main_#t~short10|) (and .cse5 (not |c_ULTIMATE.start_main_#t~short10|) .cse6)))) is different from true [2020-10-24 14:48:52,857 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_1 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse0 ((_ to_fp 11 53) c_~CRM 10.0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse1)) (not (fp.geq .cse2 .cse1)) (not (= .cse2 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3))) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse4)) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from true [2020-10-24 14:48:59,373 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse0 .cse2))))) (= roundNearestTiesToEven c_~CRM) (or (forall ((|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|)))) (or (not (= (_ +zero 11 53) .cse4)) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse4))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|)))) (or (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse5)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse5)))))) is different from false [2020-10-24 14:49:06,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not |c_ULTIMATE.start_main_#t~short20|))) (and (let ((.cse1 (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse8 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse5 .cse6) (= .cse7 .cse8) (= .cse6 .cse8) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse5 .cse7)))))) (.cse2 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 .cse1 .cse2 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (_ +zero 11 53) .cse3) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse3)))))) (and .cse1 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse4) (= (_ +zero 11 53) .cse4)))) .cse2 |c_ULTIMATE.start_main_#t~short20|))) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|)))) (or (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse9)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse9))))))) is different from false [2020-10-24 14:49:09,456 WARN L193 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2020-10-24 14:49:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:49:09,540 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-10-24 14:49:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 14:49:09,545 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 12 [2020-10-24 14:49:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:49:09,546 INFO L225 Difference]: With dead ends: 27 [2020-10-24 14:49:09,546 INFO L226 Difference]: Without dead ends: 23 [2020-10-24 14:49:09,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=56, Invalid=112, Unknown=20, NotChecked=462, Total=650 [2020-10-24 14:49:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-24 14:49:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2020-10-24 14:49:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-24 14:49:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-10-24 14:49:09,554 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2020-10-24 14:49:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:49:09,554 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-10-24 14:49:09,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 14:49:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-10-24 14:49:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:49:09,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:49:09,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:49:09,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 14:49:09,770 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:49:09,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:49:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 848629873, now seen corresponding path program 1 times [2020-10-24 14:49:09,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:49:09,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8587500] [2020-10-24 14:49:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:49:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:49:11,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 14:49:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:49:11,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:49:11,428 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 14:49:11,848 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-24 14:49:12,189 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 14:49:12,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:49:14,440 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) is different from false [2020-10-24 14:49:16,551 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) is different from true [2020-10-24 14:49:16,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:49:21,717 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short20| (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))))) is different from false [2020-10-24 14:49:23,809 WARN L860 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short20| (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))))) is different from true [2020-10-24 14:49:30,322 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))) is different from false [2020-10-24 14:49:32,411 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))) is different from true [2020-10-24 14:49:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:49:40,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:50:00,036 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 14:50:02,297 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 14:50:02,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:50:02,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:50:04,563 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-10-24 14:50:06,818 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))) (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-10-24 14:50:13,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_11)))) (or (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (fp.div ~CRM .cse1 .cse0) .cse2)) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3) (not (fp.geq .cse1 .cse4)) (not (= (_ +zero 11 53) .cse4)) (not (fp.leq .cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))))) is different from false [2020-10-24 14:50:15,446 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_11)))) (or (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (fp.div ~CRM .cse1 .cse0) .cse2)) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3) (not (fp.geq .cse1 .cse4)) (not (= (_ +zero 11 53) .cse4)) (not (fp.leq .cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))))) is different from true [2020-10-24 14:50:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:50:15,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8587500] [2020-10-24 14:50:15,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:50:15,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 15 [2020-10-24 14:50:15,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010623891] [2020-10-24 14:50:15,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 14:50:15,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:50:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 14:50:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=40, Unknown=16, NotChecked=126, Total=210 [2020-10-24 14:50:15,451 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 15 states. [2020-10-24 14:50:48,860 WARN L193 SmtUtils]: Spent 28.84 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-10-24 14:50:53,466 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= (_ +zero 11 53) .cse0)))) (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse1) .cse2)) (not (= .cse1 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3)))) (not |c_ULTIMATE.start_main_#t~short10|))) is different from true [2020-10-24 14:51:12,157 WARN L193 SmtUtils]: Spent 11.90 s on a formula simplification that was a NOOP. DAG size: 53 [2020-10-24 14:51:17,018 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (let ((.cse3 (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse4) (= (_ +zero 11 53) .cse4)))))) (or (and .cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse3)))) is different from true [2020-10-24 14:51:19,278 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3) (= (_ +zero 11 53) .cse3))))) is different from true [2020-10-24 14:51:25,201 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse3) (not (= (_ +zero 11 53) .cse3)))))) is different from false [2020-10-24 14:51:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:51:33,630 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-24 14:51:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 14:51:33,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-10-24 14:51:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:51:33,631 INFO L225 Difference]: With dead ends: 23 [2020-10-24 14:51:33,631 INFO L226 Difference]: Without dead ends: 17 [2020-10-24 14:51:33,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 104.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=24, NotChecked=286, Total=420 [2020-10-24 14:51:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-10-24 14:51:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-24 14:51:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-24 14:51:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-24 14:51:33,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-10-24 14:51:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:51:33,637 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-24 14:51:33,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 14:51:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-10-24 14:51:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:51:33,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:51:33,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:51:33,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 14:51:33,845 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:51:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:51:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 905828593, now seen corresponding path program 1 times [2020-10-24 14:51:33,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:51:33,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406078448] [2020-10-24 14:51:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-10-24 14:51:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:51:34,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-24 14:51:34,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:51:34,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:34,926 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-10-24 14:51:34,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:35,533 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-24 14:51:35,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:36,090 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-24 14:51:36,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:36,457 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-10-24 14:51:38,507 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_3 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= (_ +zero 11 53) .cse0)))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (and (= (fp.mul c_~CRM .cse1 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.sub c_~CRM .cse2 .cse1))))) (exists ((v_prenex_4 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3))))) is different from false [2020-10-24 14:51:40,603 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp.mul c_~CRM .cse2 .cse2)) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19)))) (and (= .cse0 .cse1) (fp.geq .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM 10.0)) (= (_ +zero 11 53) .cse3) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse5) (fp.leq .cse2 .cse4) (= (fp.add c_~CRM .cse0 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 .cse6) (= .cse7 (fp.sub c_~CRM .cse6 .cse2)) (not (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))))) is different from false [2020-10-24 14:51:42,655 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp.mul c_~CRM .cse2 .cse2)) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19)))) (and (= .cse0 .cse1) (fp.geq .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM 10.0)) (= (_ +zero 11 53) .cse3) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse5) (fp.leq .cse2 .cse4) (= (fp.add c_~CRM .cse0 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 .cse6) (= .cse7 (fp.sub c_~CRM .cse6 .cse2)) (not (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))))) is different from true [2020-10-24 14:51:42,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:42,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:42,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:51:49,014 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (fp.geq .cse2 .cse3) (= .cse4 (fp.sub roundNearestTiesToEven .cse5 .cse2)) (= (_ +zero 11 53) .cse3) (fp.leq .cse2 .cse6) (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse7 .cse0)) (= .cse8 .cse9) (= (fp.add roundNearestTiesToEven .cse8 .cse1) .cse7) (= .cse9 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse6))))) (not |c_ULTIMATE.start_main_#t~short20|)) (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse13 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse14 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse12 .cse12)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse17 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) (fp.geq .cse12 .cse13) (= .cse14 (fp.sub roundNearestTiesToEven .cse15 .cse12)) (= (_ +zero 11 53) .cse13) (fp.leq .cse16 .cse10) (fp.leq .cse12 .cse17) (not (fp.geq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse18 .cse19) (= (fp.add roundNearestTiesToEven .cse18 .cse11) .cse16) (= .cse19 .cse15) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse17))))) |c_ULTIMATE.start_main_#t~short20|)) is different from false [2020-10-24 14:51:51,062 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (fp.geq .cse2 .cse3) (= .cse4 (fp.sub roundNearestTiesToEven .cse5 .cse2)) (= (_ +zero 11 53) .cse3) (fp.leq .cse2 .cse6) (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse7 .cse0)) (= .cse8 .cse9) (= (fp.add roundNearestTiesToEven .cse8 .cse1) .cse7) (= .cse9 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse6))))) (not |c_ULTIMATE.start_main_#t~short20|)) (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse13 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse14 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse12 .cse12)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse17 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) (fp.geq .cse12 .cse13) (= .cse14 (fp.sub roundNearestTiesToEven .cse15 .cse12)) (= (_ +zero 11 53) .cse13) (fp.leq .cse16 .cse10) (fp.leq .cse12 .cse17) (not (fp.geq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse18 .cse19) (= (fp.add roundNearestTiesToEven .cse18 .cse11) .cse16) (= .cse19 .cse15) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse17))))) |c_ULTIMATE.start_main_#t~short20|)) is different from true [2020-10-24 14:51:51,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:13,287 WARN L193 SmtUtils]: Spent 11.18 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-24 14:52:19,487 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (fp.geq .cse2 .cse3) (= .cse4 (fp.sub roundNearestTiesToEven .cse5 .cse2)) (= (_ +zero 11 53) .cse3) (fp.leq .cse2 .cse6) (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse7 .cse0)) (= .cse8 .cse9) (= (fp.add roundNearestTiesToEven .cse8 .cse1) .cse7) (= .cse9 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse6))))) is different from false [2020-10-24 14:52:21,537 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (fp.geq .cse2 .cse3) (= .cse4 (fp.sub roundNearestTiesToEven .cse5 .cse2)) (= (_ +zero 11 53) .cse3) (fp.leq .cse2 .cse6) (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse7 .cse0)) (= .cse8 .cse9) (= (fp.add roundNearestTiesToEven .cse8 .cse1) .cse7) (= .cse9 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse6))))) is different from true [2020-10-24 14:52:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:52:21,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:52:29,361 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4)))))))) is different from true [2020-10-24 14:52:58,795 WARN L193 SmtUtils]: Spent 11.01 s on a formula simplification that was a NOOP. DAG size: 64 [2020-10-24 14:53:00,889 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse0 .cse0) .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse2 (fp.sub c_~CRM .cse1 .cse0)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse3 .cse4) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (fp.leq .cse5 .cse6) (not (= .cse3 (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse7 .cse7))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 14:53:00,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:53:00,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:53:32,853 WARN L193 SmtUtils]: Spent 10.55 s on a formula simplification that was a NOOP. DAG size: 66 [2020-10-24 14:53:34,965 WARN L860 $PredicateComparison]: unable to prove that (or (not |c_ULTIMATE.start_main_#t~short10|) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse0 .cse0) .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse2 (fp.sub c_~CRM .cse1 .cse0)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse3 .cse4) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (fp.leq .cse5 .cse6) (not (= .cse3 (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse7 .cse7))))))) (forall ((|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|)))) (or (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse8)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8)))))) is different from true [2020-10-24 14:53:37,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse3 .cse6) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse7)))))) is different from false [2020-10-24 14:53:39,106 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse3 .cse6) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse7)))))) is different from true [2020-10-24 14:53:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:53:39,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406078448] [2020-10-24 14:53:39,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:53:39,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2020-10-24 14:53:39,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306321307] [2020-10-24 14:53:39,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 14:53:39,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:53:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 14:53:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=116, Unknown=28, NotChecked=232, Total=420 [2020-10-24 14:53:39,112 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 21 states. [2020-10-24 14:53:43,475 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse3 .cse6) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse7))))))) is different from false [2020-10-24 14:54:09,573 WARN L193 SmtUtils]: Spent 18.89 s on a formula simplification that was a NOOP. DAG size: 98 [2020-10-24 14:54:43,100 WARN L193 SmtUtils]: Spent 21.45 s on a formula simplification that was a NOOP. DAG size: 96 [2020-10-24 14:56:03,397 WARN L193 SmtUtils]: Spent 1.13 m on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2020-10-24 14:56:33,098 WARN L193 SmtUtils]: Spent 20.96 s on a formula simplification that was a NOOP. DAG size: 88 [2020-10-24 14:57:47,395 WARN L193 SmtUtils]: Spent 23.52 s on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 14:57:53,879 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|)))) (or (not (= ((_ to_fp 11 53) c_~CRM 105.0) .cse0)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse0)))) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse5 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp.mul c_~CRM .cse3 .cse3)) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19)))) (and (= .cse1 .cse2) (fp.geq .cse3 .cse4) (= .cse5 ((_ to_fp 11 53) c_~CRM 10.0)) (= (_ +zero 11 53) .cse4) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse6) (fp.leq .cse3 .cse5) (= (fp.add c_~CRM .cse1 .cse6) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 .cse7) (= .cse8 (fp.sub c_~CRM .cse7 .cse3)) (not (fp.geq .cse8 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))))) is different from false [2020-10-24 14:57:59,843 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (fp.geq .cse2 .cse3) (= .cse4 (fp.sub roundNearestTiesToEven .cse5 .cse2)) (= (_ +zero 11 53) .cse3) (fp.leq .cse2 .cse6) (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse7 .cse0)) (= .cse8 .cse9) (= (fp.add roundNearestTiesToEven .cse8 .cse1) .cse7) (= .cse9 .cse5) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse6))))) (not |c_ULTIMATE.start_main_#t~short20|)) (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse13 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse14 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse12 .cse12)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse17 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 105.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) (fp.geq .cse12 .cse13) (= .cse14 (fp.sub roundNearestTiesToEven .cse15 .cse12)) (= (_ +zero 11 53) .cse13) (fp.leq .cse16 .cse10) (fp.leq .cse12 .cse17) (not (fp.geq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse18 .cse19) (= (fp.add roundNearestTiesToEven .cse18 .cse11) .cse16) (= .cse19 .cse15) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse17))))) |c_ULTIMATE.start_main_#t~short20|)) |c_ULTIMATE.start_main_#t~short20|) is different from false [2020-10-24 14:58:09,009 WARN L193 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 83 DAG size of output: 5 [2020-10-24 14:58:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:58:13,216 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-24 14:58:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 14:58:13,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 12 [2020-10-24 14:58:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:58:13,218 INFO L225 Difference]: With dead ends: 23 [2020-10-24 14:58:13,218 INFO L226 Difference]: Without dead ends: 19 [2020-10-24 14:58:13,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 342.3s TimeCoverageRelationStatistics Valid=81, Invalid=249, Unknown=56, NotChecked=484, Total=870 [2020-10-24 14:58:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-10-24 14:58:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-24 14:58:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-24 14:58:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-10-24 14:58:13,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2020-10-24 14:58:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:58:13,223 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-24 14:58:13,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 14:58:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-10-24 14:58:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:58:13,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:58:13,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:58:13,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 14:58:13,434 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:58:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:58:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash 905888175, now seen corresponding path program 1 times [2020-10-24 14:58:13,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:58:13,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500256123] [2020-10-24 14:58:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-24 14:58:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:58:13,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 14:58:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:58:15,738 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2020-10-24 14:58:15,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:58:17,735 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-10-24 14:58:17,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:58:18,415 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 14:58:20,495 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (fp.leq .cse2 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))))) is different from false [2020-10-24 14:58:22,546 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (fp.leq .cse2 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)))))) is different from true [2020-10-24 14:58:22,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:58:28,799 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse7 .cse8) (= .cse5 (fp.mul roundNearestTiesToEven .cse9 .cse9)) (fp.leq .cse9 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse8)))))) is different from false [2020-10-24 14:58:30,849 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse7 .cse8) (= .cse5 (fp.mul roundNearestTiesToEven .cse9 .cse9)) (fp.leq .cse9 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse8)))))) is different from true [2020-10-24 14:58:37,086 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from false [2020-10-24 14:58:39,132 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from true [2020-10-24 14:58:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:58:47,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:58:50,242 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) is different from true [2020-10-24 14:58:52,367 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 14:58:52,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:58:52,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:58:54,485 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-10-24 14:58:56,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|))))))) is different from false [2020-10-24 14:58:58,616 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|))))))) is different from true [2020-10-24 14:58:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:58:58,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500256123] [2020-10-24 14:58:58,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:58:58,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2020-10-24 14:58:58,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084076514] [2020-10-24 14:58:58,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 14:58:58,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:58:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 14:58:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=42, Unknown=11, NotChecked=126, Total=210 [2020-10-24 14:58:58,641 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 15 states. [2020-10-24 14:59:00,917 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|)))))))) is different from false [2020-10-24 14:59:19,371 WARN L193 SmtUtils]: Spent 13.87 s on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-24 14:59:39,306 WARN L193 SmtUtils]: Spent 17.39 s on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-10-24 14:59:44,943 WARN L193 SmtUtils]: Spent 5.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-10-24 14:59:58,538 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|)))) (or (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse0) (not (= (_ +zero 11 53) .cse0))))) (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse1 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))))))) is different from false [2020-10-24 15:00:03,024 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_prenex_5 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse7 .cse8) (= .cse5 (fp.mul roundNearestTiesToEven .cse9 .cse9)) (fp.leq .cse9 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (= (_ +zero 11 53) .cse8)))))) |c_ULTIMATE.start_main_#t~short20|) is different from false [2020-10-24 15:00:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:00:03,381 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-24 15:00:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:00:03,382 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-10-24 15:00:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:00:03,382 INFO L225 Difference]: With dead ends: 23 [2020-10-24 15:00:03,383 INFO L226 Difference]: Without dead ends: 13 [2020-10-24 15:00:03,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.0s TimeCoverageRelationStatistics Valid=54, Invalid=79, Unknown=17, NotChecked=270, Total=420 [2020-10-24 15:00:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-10-24 15:00:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-24 15:00:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-24 15:00:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-24 15:00:03,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2020-10-24 15:00:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:00:03,386 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-24 15:00:03,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 15:00:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-10-24 15:00:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 15:00:03,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:00:03,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:00:03,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:00:03,592 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:00:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:00:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash 455543281, now seen corresponding path program 1 times [2020-10-24 15:00:03,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:00:03,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096242078] [2020-10-24 15:00:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-24 15:00:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:00:04,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 15:00:04,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:00:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:00:05,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:00:05,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 15:00:05,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:00:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:00:05,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096242078] [2020-10-24 15:00:05,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:00:05,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:00:05,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585286837] [2020-10-24 15:00:05,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:00:05,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:00:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:00:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:00:05,193 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2020-10-24 15:00:05,511 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 15:00:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:00:05,513 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-24 15:00:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:00:05,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-24 15:00:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:00:05,513 INFO L225 Difference]: With dead ends: 13 [2020-10-24 15:00:05,514 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 15:00:05,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:00:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 15:00:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 15:00:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 15:00:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 15:00:05,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-10-24 15:00:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:00:05,516 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 15:00:05,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:00:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 15:00:05,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 15:00:05,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:00:05,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L27-2(line 27) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L21-2(line 21) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 15:00:05,765 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L277 CegarLoopResult]: At program point L28(lines 16 29) the Hoare annotation is: true [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point L24-2(lines 24 25) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-24 15:00:05,766 INFO L277 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-10-24 15:00:05,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:05 BoogieIcfgContainer [2020-10-24 15:00:05,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:00:05,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:00:05,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:00:05,775 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:00:05,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:40" (3/4) ... [2020-10-24 15:00:05,780 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 15:00:05,793 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-10-24 15:00:05,794 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-24 15:00:05,794 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-24 15:00:05,794 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 15:00:05,846 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 15:00:05,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:00:05,849 INFO L168 Benchmark]: Toolchain (without parser) took 749113.91 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 23.7 MB in the beginning and 22.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,850 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 33.6 MB. Free memory was 16.4 MB in the beginning and 16.3 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:00:05,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.39 ms. Allocated memory is still 41.9 MB. Free memory was 23.1 MB in the beginning and 22.5 MB in the end (delta: 585.5 kB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.76 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 20.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,851 INFO L168 Benchmark]: Boogie Preprocessor took 34.83 ms. Allocated memory is still 41.9 MB. Free memory was 20.8 MB in the beginning and 19.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:00:05,852 INFO L168 Benchmark]: RCFGBuilder took 3658.33 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.5 MB in the beginning and 31.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,858 INFO L168 Benchmark]: TraceAbstraction took 744929.83 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 24.6 MB in the end (delta: 6.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,858 INFO L168 Benchmark]: Witness Printer took 72.28 ms. Allocated memory is still 50.3 MB. Free memory was 24.6 MB in the beginning and 22.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:05,866 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.27 ms. Allocated memory is still 33.6 MB. Free memory was 16.4 MB in the beginning and 16.3 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.39 ms. Allocated memory is still 41.9 MB. Free memory was 23.1 MB in the beginning and 22.5 MB in the end (delta: 585.5 kB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.76 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 20.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.83 ms. Allocated memory is still 41.9 MB. Free memory was 20.8 MB in the beginning and 19.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 3658.33 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.5 MB in the beginning and 31.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 744929.83 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 24.6 MB in the end (delta: 6.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Witness Printer took 72.28 ms. Allocated memory is still 50.3 MB. Free memory was 24.6 MB in the beginning and 22.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 744.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 457.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 61 SDtfs, 25 SDslu, 161 SDs, 0 SdLazy, 148 SolverSat, 3 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 79.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 46 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 585.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 279.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 132 ConstructedInterpolants, 68 QuantifiedInterpolants, 73040 SizeOfPredicates, 48 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...