./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Double_div.i --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/floats-esbmc-regression/Double_div.i -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 d14c90708f35eac31ae5d9fda6b5469e825b2252 .................................................................................................................................................................................................................................... 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/floats-esbmc-regression/Double_div.i -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 d14c90708f35eac31ae5d9fda6b5469e825b2252 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:48:57,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:48:57,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:48:57,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:48:57,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:48:57,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:48:57,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:48:57,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:48:57,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:48:57,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:48:57,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:48:57,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:48:57,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:48:57,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:48:57,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:48:57,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:48:57,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:48:57,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:48:57,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:48:57,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:48:57,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:48:57,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:48:57,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:48:57,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:48:57,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:48:57,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:48:57,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:48:57,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:48:57,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:48:57,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:48:57,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:48:57,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:48:57,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:48:57,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:48:57,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:48:57,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:48:57,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:48:57,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:48:57,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:48:57,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:48:57,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:48:57,506 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:48:57,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:48:57,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:48:57,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:48:57,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:48:57,551 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:48:57,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:48:57,552 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:48:57,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 14:48:57,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:48:57,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:48:57,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:48:57,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:48:57,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:48:57,555 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:48:57,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:48:57,555 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:48:57,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:48:57,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:48:57,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:48:57,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:48:57,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:48:57,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:48:57,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:48:57,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:48:57,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:48:57,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 14:48:57,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 14:48:57,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:48:57,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:48:57,560 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 -> d14c90708f35eac31ae5d9fda6b5469e825b2252 [2020-10-24 14:48:58,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:48:58,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:48:58,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:48:58,121 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:48:58,123 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:48:58,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2020-10-24 14:48:58,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/079d63ebe/34b9449c038b45748026f23d461dccdc/FLAG71e57df79 [2020-10-24 14:48:58,992 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:48:58,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2020-10-24 14:48:59,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/079d63ebe/34b9449c038b45748026f23d461dccdc/FLAG71e57df79 [2020-10-24 14:48:59,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/079d63ebe/34b9449c038b45748026f23d461dccdc [2020-10-24 14:48:59,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:48:59,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:48:59,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:48:59,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:48:59,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:48:59,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c763e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59, skipping insertion in model container [2020-10-24 14:48:59,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,383 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:48:59,401 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:48:59,615 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:48:59,626 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:48:59,644 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:48:59,662 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:48:59,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59 WrapperNode [2020-10-24 14:48:59,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:48:59,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:48:59,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:48:59,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:48:59,675 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:48:59" (1/1) ... [2020-10-24 14:48:59,684 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:48:59" (1/1) ... [2020-10-24 14:48:59,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:48:59,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:48:59,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:48:59,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:48:59,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (1/1) ... [2020-10-24 14:48:59,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:48:59,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:48:59,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:48:59,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:48:59,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (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:48:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 14:48:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:48:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:48:59,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:49:00,297 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:49:00,297 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-24 14:49:00,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:00 BoogieIcfgContainer [2020-10-24 14:49:00,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:49:00,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:49:00,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:49:00,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:49:00,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:48:59" (1/3) ... [2020-10-24 14:49:00,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57495598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:00, skipping insertion in model container [2020-10-24 14:49:00,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:59" (2/3) ... [2020-10-24 14:49:00,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57495598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:00, skipping insertion in model container [2020-10-24 14:49:00,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:00" (3/3) ... [2020-10-24 14:49:00,317 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2020-10-24 14:49:00,331 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:49:00,338 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:49:00,356 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:49:00,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:49:00,417 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:49:00,418 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:49:00,419 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:49:00,419 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:49:00,420 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:49:00,420 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:49:00,420 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:49:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-24 14:49:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:49:00,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:49:00,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:49:00,455 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:49:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:49:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash 239624332, now seen corresponding path program 1 times [2020-10-24 14:49:00,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:49:00,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941828905] [2020-10-24 14:49:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:49:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:49:00,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:49:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:49:00,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:49:00,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 14:49:00,736 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 14:49:00,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 14:49:00,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:49:00 BoogieIcfgContainer [2020-10-24 14:49:00,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:49:00,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:49:00,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:49:00,787 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:49:00,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:00" (3/4) ... [2020-10-24 14:49:00,793 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:49:00,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:49:00,799 INFO L168 Benchmark]: Toolchain (without parser) took 1441.03 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 17.2 MB in the beginning and 27.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-10-24 14:49:00,802 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 39.8 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 35.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:49:00,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.65 ms. Allocated memory is still 39.8 MB. Free memory was 16.6 MB in the beginning and 18.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-24 14:49:00,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.98 ms. Allocated memory is still 39.8 MB. Free memory was 18.3 MB in the beginning and 17.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:49:00,808 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 16.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:49:00,810 INFO L168 Benchmark]: RCFGBuilder took 566.54 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 16.0 MB in the beginning and 28.2 MB in the end (delta: -12.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-10-24 14:49:00,811 INFO L168 Benchmark]: TraceAbstraction took 479.77 ms. Allocated memory is still 52.4 MB. Free memory was 27.8 MB in the beginning and 28.2 MB in the end (delta: -324.7 kB). Peak memory consumption was 701.3 kB. Max. memory is 16.1 GB. [2020-10-24 14:49:00,812 INFO L168 Benchmark]: Witness Printer took 7.82 ms. Allocated memory is still 52.4 MB. Free memory was 27.9 MB in the beginning and 27.7 MB in the end (delta: 262.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:49:00,830 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.34 ms. Allocated memory is still 39.8 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 35.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 302.65 ms. Allocated memory is still 39.8 MB. Free memory was 16.6 MB in the beginning and 18.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.98 ms. Allocated memory is still 39.8 MB. Free memory was 18.3 MB in the beginning and 17.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.71 ms. Allocated memory is still 39.8 MB. Free memory was 17.0 MB in the beginning and 16.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 566.54 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 16.0 MB in the beginning and 28.2 MB in the end (delta: -12.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 479.77 ms. Allocated memory is still 52.4 MB. Free memory was 27.8 MB in the beginning and 28.2 MB in the end (delta: -324.7 kB). Peak memory consumption was 701.3 kB. Max. memory is 16.1 GB. * Witness Printer took 7.82 ms. Allocated memory is still 52.4 MB. Free memory was 27.9 MB in the beginning and 27.7 MB in the end (delta: 262.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: 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 21, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 29. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/2.5; [L23] COND FALSE !(x1 != x) [L13] COND TRUE !(cond) [L12] COND FALSE !(0) [L12] __assert_fail ("0", "Double_div.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:49:03,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:49:03,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:49:03,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:49:03,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:49:03,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:49:03,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:49:03,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:49:03,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:49:03,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:49:03,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:49:03,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:49:03,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:49:03,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:49:03,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:49:03,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:49:03,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:49:03,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:49:03,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:49:03,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:49:03,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:49:03,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:49:03,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:49:03,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:49:03,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:49:03,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:49:03,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:49:03,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:49:03,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:49:03,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:49:03,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:49:03,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:49:03,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:49:03,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:49:03,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:49:03,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:49:03,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:49:03,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:49:03,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:49:03,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:49:03,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:49:03,724 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:49:03,781 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:49:03,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:49:03,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:49:03,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:49:03,784 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:49:03,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:49:03,785 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:49:03,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:49:03,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:49:03,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:49:03,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:49:03,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:49:03,786 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 14:49:03,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 14:49:03,787 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:49:03,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:49:03,787 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:49:03,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:49:03,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:49:03,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:49:03,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:49:03,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:49:03,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:49:03,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:49:03,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:49:03,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:49:03,790 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 14:49:03,790 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 14:49:03,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:49:03,791 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:49:03,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 14:49:03,791 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 -> d14c90708f35eac31ae5d9fda6b5469e825b2252 [2020-10-24 14:49:04,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:49:04,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:49:04,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:49:04,256 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:49:04,258 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:49:04,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2020-10-24 14:49:04,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4fab05f6f/010304d3ecd149eb8171c86f7403b683/FLAG83fbb6ceb [2020-10-24 14:49:05,003 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:49:05,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2020-10-24 14:49:05,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4fab05f6f/010304d3ecd149eb8171c86f7403b683/FLAG83fbb6ceb [2020-10-24 14:49:05,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4fab05f6f/010304d3ecd149eb8171c86f7403b683 [2020-10-24 14:49:05,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:49:05,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:49:05,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:49:05,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:49:05,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:49:05,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1724d209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05, skipping insertion in model container [2020-10-24 14:49:05,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,460 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:49:05,486 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:49:05,742 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:49:05,760 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:49:05,780 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:49:05,805 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:49:05,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05 WrapperNode [2020-10-24 14:49:05,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:49:05,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:49:05,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:49:05,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:49:05,818 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:49:05" (1/1) ... [2020-10-24 14:49:05,830 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:49:05" (1/1) ... [2020-10-24 14:49:05,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:49:05,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:49:05,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:49:05,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:49:05,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (1/1) ... [2020-10-24 14:49:05,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:49:05,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:49:05,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:49:05,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:49:05,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (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:49:05,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 14:49:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 14:49:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:49:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:49:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:49:08,449 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:49:08,450 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-24 14:49:08,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:08 BoogieIcfgContainer [2020-10-24 14:49:08,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:49:08,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:49:08,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:49:08,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:49:08,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:49:05" (1/3) ... [2020-10-24 14:49:08,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec417f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:08, skipping insertion in model container [2020-10-24 14:49:08,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:49:05" (2/3) ... [2020-10-24 14:49:08,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec417f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:49:08, skipping insertion in model container [2020-10-24 14:49:08,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:08" (3/3) ... [2020-10-24 14:49:08,463 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2020-10-24 14:49:08,485 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:49:08,491 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:49:08,506 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:49:08,538 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:49:08,538 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:49:08,538 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:49:08,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:49:08,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:49:08,539 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:49:08,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:49:08,540 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:49:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-24 14:49:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:49:08,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:49:08,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:49:08,569 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:49:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:49:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash 239624332, now seen corresponding path program 1 times [2020-10-24 14:49:08,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:49:08,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694639739] [2020-10-24 14:49:08,598 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:49:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:49:09,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-24 14:49:09,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:49:21,681 WARN L193 SmtUtils]: Spent 7.97 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 14:49:21,696 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:21,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:49:26,234 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet4_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_7 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_8 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_7))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_8)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse0)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1)) (not (= .cse2 (fp.div c_~CRM .cse1 .cse0))) (not (fp.eq .cse2 .cse1))))) is different from true [2020-10-24 14:49:26,236 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:26,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694639739] [2020-10-24 14:49:26,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:49:26,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-10-24 14:49:26,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882919530] [2020-10-24 14:49:26,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 14:49:26,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:49:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 14:49:26,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=12, Unknown=3, NotChecked=6, Total=30 [2020-10-24 14:49:26,262 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 6 states. [2020-10-24 14:49:33,029 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 14:49:35,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.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)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet4_6| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_6|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse1) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div roundNearestTiesToEven (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))))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) .cse0)))) is different from false [2020-10-24 14:49:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:49:38,876 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-10-24 14:49:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 14:49:38,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-10-24 14:49:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:49:38,887 INFO L225 Difference]: With dead ends: 25 [2020-10-24 14:49:38,888 INFO L226 Difference]: Without dead ends: 10 [2020-10-24 14:49:38,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=14, Invalid=18, Unknown=6, NotChecked=18, Total=56 [2020-10-24 14:49:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-10-24 14:49:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-24 14:49:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-24 14:49:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-10-24 14:49:38,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-10-24 14:49:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:49:38,930 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-10-24 14:49:38,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 14:49:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-10-24 14:49:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-24 14:49:38,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:49:38,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:49:39,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 14:49:39,146 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:49:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:49:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash 438817201, now seen corresponding path program 1 times [2020-10-24 14:49:39,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:49:39,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035541989] [2020-10-24 14:49:39,153 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:49:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:49:41,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-24 14:49:41,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:49:43,302 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet4_8| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.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))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_8|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))))))) is different from false [2020-10-24 14:49:45,725 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_9))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_8|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) (= (fp.div roundNearestTiesToEven .cse0 .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))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|)))) (and (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (= (fp.div roundNearestTiesToEven (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) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0))))))) is different from false [2020-10-24 14:49:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-10-24 14:49:45,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:49:48,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_9))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1)) (not (fp.eq .cse2 .cse0))))) is different from false [2020-10-24 14:49:50,443 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_9))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1)) (not (fp.eq .cse2 .cse0))))) is different from true [2020-10-24 14:49:52,900 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_10 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_8|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_9))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_10))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|))) (.cse5 (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 (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 .cse4)) (not (= (fp.div c_~CRM .cse5 .cse3) .cse0)) (not (fp.eq .cse2 .cse0)) (not (= .cse4 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5))))) is different from true [2020-10-24 14:49:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-10-24 14:49:52,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035541989] [2020-10-24 14:49:52,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 14:49:52,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-24 14:49:52,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925241841] [2020-10-24 14:49:52,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 14:49:52,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:49:52,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 14:49:52,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2020-10-24 14:49:52,909 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2020-10-24 14:49:57,898 WARN L193 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 49 [2020-10-24 14:50:00,696 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_9))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1)) (not (fp.eq .cse2 .cse0))))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (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)))) (exists ((|v_ULTIMATE.start_main_#t~nondet4_8| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_8|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div c_~CRM .cse3 .cse4)) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))))))) is different from false [2020-10-24 14:50:03,189 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_9))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_8|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) (= (fp.div roundNearestTiesToEven .cse0 .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))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_6|)))) (and (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (= (fp.div roundNearestTiesToEven (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) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (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))))) is different from false [2020-10-24 14:50:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:50:07,840 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-10-24 14:50:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 14:50:07,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-24 14:50:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:50:07,842 INFO L225 Difference]: With dead ends: 17 [2020-10-24 14:50:07,842 INFO L226 Difference]: Without dead ends: 11 [2020-10-24 14:50:07,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=20, Invalid=16, Unknown=8, NotChecked=66, Total=110 [2020-10-24 14:50:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-10-24 14:50:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-24 14:50:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-24 14:50:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-10-24 14:50:07,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-10-24 14:50:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:50:07,853 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-10-24 14:50:07,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 14:50:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-10-24 14:50:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 14:50:07,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:50:07,854 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:50:08,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 14:50:08,057 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:50:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:50:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1976138452, now seen corresponding path program 2 times [2020-10-24 14:50:08,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:50:08,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161309464] [2020-10-24 14:50:08,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:50:10,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 14:50:10,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 14:50:11,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-24 14:50:11,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:50:13,408 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64))) (let ((.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))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1) (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0))))))) is different from false [2020-10-24 14:50:15,866 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (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))) (.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))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|)))) (and (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse1 .cse2) (= (fp.div c_~CRM .cse0 .cse3) .cse4) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div c_~CRM .cse4 .cse1)) (= .cse2 .cse3))))) is different from false [2020-10-24 14:50:18,772 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (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))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse3 .cse4) (= .cse4 .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)) (fp.div c_~CRM .cse2 .cse3))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse5) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (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)) .cse5)))))) is different from false [2020-10-24 14:50:21,679 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (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))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse3 .cse4) (= .cse4 .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)) (fp.div c_~CRM .cse2 .cse3))))) (exists ((ULTIMATE.start_main_~x1~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x1~0) ((_ extract 62 52) ULTIMATE.start_main_~x1~0) ((_ extract 51 0) ULTIMATE.start_main_~x1~0))) (.cse6 (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 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|)))) (and (fp.eq .cse5 .cse6) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse7) (= .cse5 (fp.div c_~CRM .cse6 .cse7)))))) is different from false [2020-10-24 14:50:21,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 14:50:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-10-24 14:50:26,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:50:27,431 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 14:50:29,699 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_13 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_13))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (fp.eq .cse0 .cse1)))))) is different from true [2020-10-24 14:50:32,187 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_14)))) (or (not (= .cse0 .cse1)) (not (fp.eq .cse2 .cse3)) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) .cse0))) (not (= .cse1 .cse4)) (not (= .cse2 (fp.div c_~CRM .cse3 .cse4))) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))))) is different from true [2020-10-24 14:50:35,090 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_15 (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_16))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_15))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_13))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_14)))) (or (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0)) (not (= .cse1 .cse2)) (not (fp.eq .cse3 .cse4)) (not (= (fp.div c_~CRM .cse0 .cse5) .cse6)) (not (= .cse2 .cse7)) (not (= (fp.div c_~CRM .cse6 .cse1) .cse4)) (not (= .cse2 .cse5)) (not (= .cse3 (fp.div c_~CRM .cse4 .cse7))) (fp.eq .cse4 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))))) is different from true [2020-10-24 14:50:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-10-24 14:50:35,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161309464] [2020-10-24 14:50:35,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 14:50:35,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-10-24 14:50:35,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539499441] [2020-10-24 14:50:35,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 14:50:35,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:50:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 14:50:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=27, Unknown=7, NotChecked=98, Total=156 [2020-10-24 14:50:35,096 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 13 states. [2020-10-24 14:50:41,154 WARN L193 SmtUtils]: Spent 3.00 s on a formula simplification that was a NOOP. DAG size: 67 [2020-10-24 14:50:43,427 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.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.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ 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))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2) (= (fp.div c_~CRM .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_13))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_14)))) (or (not (= .cse3 .cse4)) (not (fp.eq .cse5 .cse6)) (not (= .cse6 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) .cse3))) (not (= .cse4 .cse7)) (not (= .cse5 (fp.div c_~CRM .cse6 .cse7))) (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))) is different from false [2020-10-24 14:50:47,641 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x1~0_13 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x1~0_13))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (fp.eq .cse0 .cse1)))))) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse3 (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))) (.cse7 (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))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|)))) (and (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse4 .cse5) (= (fp.div c_~CRM .cse3 .cse6) .cse7) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div c_~CRM .cse7 .cse4)) (= .cse5 .cse6))))) is different from false [2020-10-24 14:50:50,358 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.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.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse1 (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))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|)))) (and (= (fp.div c_~CRM .cse1 .cse2) .cse3) (= .cse1 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse4 .cse5) (= .cse5 .cse2) (= (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.div c_~CRM .cse3 .cse4))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse6) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (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)) .cse6)))))) is different from false [2020-10-24 14:50:53,058 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_9| (_ BitVec 64))) (let ((.cse0 (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))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_10|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_9|)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (= .cse3 .cse4) (= .cse4 .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)) (fp.div c_~CRM .cse2 .cse3))))) (exists ((ULTIMATE.start_main_~x1~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_10| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x1~0) ((_ extract 62 52) ULTIMATE.start_main_~x1~0) ((_ extract 51 0) ULTIMATE.start_main_~x1~0))) (.cse6 (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 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_10|)))) (and (fp.eq .cse5 .cse6) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse7) (= .cse5 (fp.div c_~CRM .cse6 .cse7))))) (fp.eq (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)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) is different from false [2020-10-24 14:50:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:50:57,826 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-10-24 14:50:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 14:50:57,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2020-10-24 14:50:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:50:57,828 INFO L225 Difference]: With dead ends: 18 [2020-10-24 14:50:57,828 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 14:50:57,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=35, Invalid=39, Unknown=12, NotChecked=220, Total=306 [2020-10-24 14:50:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 14:50:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 14:50:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 14:50:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-10-24 14:50:57,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-10-24 14:50:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:50:57,835 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-10-24 14:50:57,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 14:50:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-10-24 14:50:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 14:50:57,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:50:57,836 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:50:58,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 14:50:58,037 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:50:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:50:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash 469647633, now seen corresponding path program 3 times [2020-10-24 14:50:58,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:50:58,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648107161] [2020-10-24 14:50:58,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:01,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-24 14:51:01,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 14:51:01,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-24 14:51:01,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:51:04,321 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4_12| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.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))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-10-24 14:51:06,808 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_14| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_17 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_14|))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.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_~x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_17))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_12|)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= .cse3 .cse1) (= .cse3 .cse4) (= .cse0 (fp.div c_~CRM .cse2 .cse4))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-10-24 14:51:09,569 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet6_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_14| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_17 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_14|))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.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))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_18))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_17))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_12|)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3) (= .cse4 .cse5) (= .cse4 .cse1) (= .cse4 .cse6) (= (fp.div c_~CRM .cse2 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0))) (= .cse0 (fp.div c_~CRM .cse3 .cse6))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-10-24 14:51:13,392 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet6_16| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_16|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse0) (= (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)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x1~0)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet4_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet6_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_19 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~x~0_17 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_14|))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_19))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet6_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet6_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet6_15|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_18))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_17))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet4_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet4_12|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= .cse2 .cse3) (= .cse2 .cse4) (= .cse5 (fp.div c_~CRM .cse6 .cse4)) (= .cse2 .cse7) (= (fp.div c_~CRM .cse5 .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))) (= .cse6 (fp.div c_~CRM .cse1 .cse7)))))) is different from false [2020-10-24 14:51:15,741 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 14:51:15,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648107161] [2020-10-24 14:51:15,743 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-10-24 14:51:15,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [269836107] [2020-10-24 14:51:15,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-24 14:51:23,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-24 14:51:23,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 14:51:23,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-24 14:51:23,210 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@6290ee55 [2020-10-24 14:51:23,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002186747] [2020-10-24 14:51:23,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 14:52:00,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-24 14:52:00,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 14:52:01,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-24 14:52:01,524 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@6290ee55 [2020-10-24 14:52:01,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:52:01,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-24 14:52:01,525 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-24 14:52:01,525 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2020-10-24 14:52:02,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 14:52:02,190 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-24 14:52:02,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:52:02 BoogieIcfgContainer [2020-10-24 14:52:02,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:52:02,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:52:02,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:52:02,195 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:52:02,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:49:08" (3/4) ... [2020-10-24 14:52:02,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:52:02,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:52:02,201 INFO L168 Benchmark]: Toolchain (without parser) took 176797.97 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.9 MB in the beginning and 29.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 194.6 kB. Max. memory is 16.1 GB. [2020-10-24 14:52:02,202 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 41.9 MB. Free memory was 26.9 MB in the beginning and 26.9 MB in the end (delta: 26.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:52:02,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.08 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.3 MB in the beginning and 24.7 MB in the end (delta: -7.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 14:52:02,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.44 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:52:02,205 INFO L168 Benchmark]: Boogie Preprocessor took 47.69 ms. Allocated memory is still 50.3 MB. Free memory was 23.2 MB in the beginning and 33.9 MB in the end (delta: -10.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-10-24 14:52:02,205 INFO L168 Benchmark]: RCFGBuilder took 2550.81 ms. Allocated memory is still 50.3 MB. Free memory was 33.7 MB in the beginning and 22.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-24 14:52:02,206 INFO L168 Benchmark]: TraceAbstraction took 173736.57 ms. Allocated memory is still 50.3 MB. Free memory was 21.9 MB in the beginning and 29.6 MB in the end (delta: -7.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:52:02,207 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 50.3 MB. Free memory was 29.3 MB in the beginning and 29.0 MB in the end (delta: 281.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:52:02,212 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.33 ms. Allocated memory is still 41.9 MB. Free memory was 26.9 MB in the beginning and 26.9 MB in the end (delta: 26.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 393.08 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.3 MB in the beginning and 24.7 MB in the end (delta: -7.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.44 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.69 ms. Allocated memory is still 50.3 MB. Free memory was 23.2 MB in the beginning and 33.9 MB in the end (delta: -10.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2550.81 ms. Allocated memory is still 50.3 MB. Free memory was 33.7 MB in the beginning and 22.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 173736.57 ms. Allocated memory is still 50.3 MB. Free memory was 21.9 MB in the beginning and 29.6 MB in the end (delta: -7.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.56 ms. Allocated memory is still 50.3 MB. Free memory was 29.3 MB in the beginning and 29.0 MB in the end (delta: 281.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L20] EXPR 1.0 [L20] double x = 1.0; [L21] EXPR 2.5 [L21] EXPR x/2.5 [L21] double x1 = x/2.5; [L23] COND TRUE x1 != x [L25] x = x1 [L26] EXPR 2.5 [L26] EXPR x/2.5 [L26] x1 = x/2.5 [L23] COND TRUE x1 != x [L25] x = x1 [L26] EXPR 2.5 [L26] EXPR x/2.5 [L26] x1 = x/2.5 [L23] COND TRUE x1 != x [L25] x = x1 [L26] EXPR 2.5 [L26] EXPR x/2.5 [L26] x1 = x/2.5 [L23] COND FALSE !(x1 != x) [L13] COND TRUE !(cond) [L12] COND FALSE !(0) [L12] __assert_fail ("0", "Double_div.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 173.6s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 50.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 3 SDslu, 81 SDs, 0 SdLazy, 24 SolverSat, 2 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.2s 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 13 QuantifiedInterpolants, 10616 SizeOfPredicates, 13 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/8 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...