./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d3efc4d3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/filter1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbf6cb56c42d2fc851e723344a93d807d314228d .................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/filter1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbf6cb56c42d2fc851e723344a93d807d314228d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-d3efc4d [2020-12-04 09:42:02,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 09:42:02,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 09:42:02,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 09:42:02,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 09:42:02,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 09:42:02,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 09:42:02,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 09:42:02,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 09:42:02,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 09:42:02,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 09:42:02,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 09:42:02,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 09:42:02,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 09:42:02,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 09:42:02,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 09:42:02,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 09:42:02,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 09:42:02,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 09:42:02,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 09:42:02,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 09:42:02,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 09:42:02,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 09:42:02,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 09:42:02,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 09:42:02,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 09:42:02,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 09:42:02,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 09:42:02,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 09:42:02,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 09:42:02,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 09:42:02,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 09:42:02,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 09:42:02,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 09:42:02,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 09:42:02,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 09:42:02,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 09:42:02,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 09:42:02,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 09:42:02,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 09:42:02,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 09:42:02,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-04 09:42:02,395 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 09:42:02,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 09:42:02,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 09:42:02,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 09:42:02,399 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 09:42:02,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 09:42:02,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-04 09:42:02,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 09:42:02,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-04 09:42:02,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 09:42:02,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 09:42:02,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 09:42:02,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 09:42:02,404 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-04 09:42:02,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 09:42:02,404 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 09:42:02,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 09:42:02,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 09:42:02,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 09:42:02,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 09:42:02,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 09:42:02,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 09:42:02,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 09:42:02,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 09:42:02,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 09:42:02,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 09:42:02,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 09:42:02,407 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 09:42:02,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbf6cb56c42d2fc851e723344a93d807d314228d [2020-12-04 09:42:02,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 09:42:02,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 09:42:02,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 09:42:02,926 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 09:42:02,927 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 09:42:02,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c [2020-12-04 09:42:03,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007797c40/454742cd58ed4617ab6c7db10ef0aecc/FLAG3002cbb96 [2020-12-04 09:42:03,851 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 09:42:03,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c [2020-12-04 09:42:03,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007797c40/454742cd58ed4617ab6c7db10ef0aecc/FLAG3002cbb96 [2020-12-04 09:42:04,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007797c40/454742cd58ed4617ab6c7db10ef0aecc [2020-12-04 09:42:04,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 09:42:04,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 09:42:04,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 09:42:04,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 09:42:04,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 09:42:04,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fd9114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04, skipping insertion in model container [2020-12-04 09:42:04,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,241 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 09:42:04,258 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-04 09:42:04,459 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c[627,640] [2020-12-04 09:42:04,479 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-04 09:42:04,491 INFO L212 MainTranslator]: Completed pre-run [2020-12-04 09:42:04,508 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c[627,640] [2020-12-04 09:42:04,513 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-04 09:42:04,533 INFO L217 MainTranslator]: Completed translation [2020-12-04 09:42:04,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04 WrapperNode [2020-12-04 09:42:04,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 09:42:04,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 09:42:04,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 09:42:04,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 09:42:04,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 09:42:04,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 09:42:04,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 09:42:04,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 09:42:04,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... [2020-12-04 09:42:04,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 09:42:04,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 09:42:04,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 09:42:04,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 09:42:04,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 09:42:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 09:42:04,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 09:42:04,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 09:42:04,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 09:42:05,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 09:42:05,071 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-04 09:42:05,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:05 BoogieIcfgContainer [2020-12-04 09:42:05,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 09:42:05,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 09:42:05,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 09:42:05,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 09:42:05,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 09:42:04" (1/3) ... [2020-12-04 09:42:05,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6809dc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 09:42:05, skipping insertion in model container [2020-12-04 09:42:05,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:04" (2/3) ... [2020-12-04 09:42:05,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6809dc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 09:42:05, skipping insertion in model container [2020-12-04 09:42:05,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:05" (3/3) ... [2020-12-04 09:42:05,085 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c [2020-12-04 09:42:05,106 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 09:42:05,110 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-04 09:42:05,126 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-04 09:42:05,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 09:42:05,195 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 09:42:05,195 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 09:42:05,196 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 09:42:05,196 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 09:42:05,196 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 09:42:05,196 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 09:42:05,196 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 09:42:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-12-04 09:42:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-04 09:42:05,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:42:05,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:42:05,240 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:42:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:42:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2020-12-04 09:42:05,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 09:42:05,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190858945] [2020-12-04 09:42:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 09:42:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:42:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:05,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190858945] [2020-12-04 09:42:05,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:42:05,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 09:42:05,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230785736] [2020-12-04 09:42:05,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 09:42:05,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 09:42:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 09:42:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 09:42:05,551 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2020-12-04 09:42:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:42:05,573 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-12-04 09:42:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 09:42:05,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-12-04 09:42:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:42:05,606 INFO L225 Difference]: With dead ends: 28 [2020-12-04 09:42:05,609 INFO L226 Difference]: Without dead ends: 11 [2020-12-04 09:42:05,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 09:42:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-04 09:42:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-12-04 09:42:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-12-04 09:42:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-12-04 09:42:05,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2020-12-04 09:42:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:42:05,662 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-12-04 09:42:05,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 09:42:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-12-04 09:42:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-04 09:42:05,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:42:05,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:42:05,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 09:42:05,667 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:42:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:42:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2020-12-04 09:42:05,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 09:42:05,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476712229] [2020-12-04 09:42:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 09:42:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-04 09:42:05,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-04 09:42:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-04 09:42:05,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-04 09:42:05,858 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-04 09:42:05,858 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-04 09:42:05,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 09:42:05,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 09:42:05 BoogieIcfgContainer [2020-12-04 09:42:05,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 09:42:05,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 09:42:05,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 09:42:05,889 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 09:42:05,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:05" (3/4) ... [2020-12-04 09:42:05,894 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-04 09:42:05,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 09:42:05,897 INFO L168 Benchmark]: Toolchain (without parser) took 1680.00 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.6 MB in the beginning and 28.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2020-12-04 09:42:05,898 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 48.2 MB. Free memory was 31.2 MB in the beginning and 31.1 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:42:05,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.12 ms. Allocated memory is still 48.2 MB. Free memory was 25.4 MB in the beginning and 28.8 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-04 09:42:05,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.08 ms. Allocated memory is still 48.2 MB. Free memory was 28.8 MB in the beginning and 27.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-04 09:42:05,901 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 48.2 MB. Free memory was 27.3 MB in the beginning and 26.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:42:05,902 INFO L168 Benchmark]: RCFGBuilder took 463.09 ms. Allocated memory is still 48.2 MB. Free memory was 26.3 MB in the beginning and 27.6 MB in the end (delta: -1.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-12-04 09:42:05,903 INFO L168 Benchmark]: TraceAbstraction took 811.81 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 27.3 MB in the beginning and 29.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-12-04 09:42:05,904 INFO L168 Benchmark]: Witness Printer took 5.31 ms. Allocated memory is still 58.7 MB. Free memory was 29.0 MB in the beginning and 28.7 MB in the end (delta: 260.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:42:05,909 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.67 ms. Allocated memory is still 48.2 MB. Free memory was 31.2 MB in the beginning and 31.1 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.12 ms. Allocated memory is still 48.2 MB. Free memory was 25.4 MB in the beginning and 28.8 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.08 ms. Allocated memory is still 48.2 MB. Free memory was 28.8 MB in the beginning and 27.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 48.2 MB. Free memory was 27.3 MB in the beginning and 26.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 463.09 ms. Allocated memory is still 48.2 MB. Free memory was 26.3 MB in the beginning and 27.6 MB in the end (delta: -1.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 811.81 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 27.3 MB in the beginning and 29.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.31 ms. Allocated memory is still 58.7 MB. Free memory was 29.0 MB in the beginning and 28.7 MB in the end (delta: 260.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 34, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 41. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L15] COND FALSE !(!cond) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-d3efc4d [2020-12-04 09:42:08,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 09:42:08,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 09:42:08,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 09:42:08,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 09:42:08,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 09:42:08,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 09:42:08,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 09:42:08,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 09:42:08,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 09:42:08,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 09:42:08,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 09:42:08,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 09:42:08,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 09:42:08,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 09:42:08,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 09:42:08,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 09:42:08,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 09:42:08,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 09:42:08,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 09:42:08,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 09:42:08,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 09:42:08,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 09:42:08,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 09:42:08,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 09:42:08,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 09:42:08,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 09:42:08,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 09:42:08,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 09:42:08,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 09:42:08,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 09:42:08,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 09:42:08,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 09:42:08,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 09:42:08,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 09:42:08,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 09:42:08,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 09:42:08,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 09:42:08,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 09:42:08,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 09:42:08,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 09:42:08,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-04 09:42:08,893 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 09:42:08,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 09:42:08,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 09:42:08,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 09:42:08,898 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 09:42:08,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 09:42:08,899 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-04 09:42:08,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-04 09:42:08,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 09:42:08,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 09:42:08,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 09:42:08,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 09:42:08,901 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-04 09:42:08,901 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-04 09:42:08,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-04 09:42:08,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 09:42:08,902 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 09:42:08,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 09:42:08,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 09:42:08,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 09:42:08,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 09:42:08,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 09:42:08,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 09:42:08,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 09:42:08,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 09:42:08,905 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-04 09:42:08,905 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-04 09:42:08,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 09:42:08,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 09:42:08,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-04 09:42:08,906 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbf6cb56c42d2fc851e723344a93d807d314228d [2020-12-04 09:42:09,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 09:42:09,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 09:42:09,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 09:42:09,389 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 09:42:09,390 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 09:42:09,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c [2020-12-04 09:42:09,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce717bf6/e77e916fc8a1443bb4ca2417025d5f9b/FLAG22656b79f [2020-12-04 09:42:10,096 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 09:42:10,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c [2020-12-04 09:42:10,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce717bf6/e77e916fc8a1443bb4ca2417025d5f9b/FLAG22656b79f [2020-12-04 09:42:10,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce717bf6/e77e916fc8a1443bb4ca2417025d5f9b [2020-12-04 09:42:10,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 09:42:10,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 09:42:10,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 09:42:10,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 09:42:10,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 09:42:10,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e7ddb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10, skipping insertion in model container [2020-12-04 09:42:10,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,567 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 09:42:10,621 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-04 09:42:10,826 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c[627,640] [2020-12-04 09:42:10,847 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-04 09:42:10,868 INFO L212 MainTranslator]: Completed pre-run [2020-12-04 09:42:10,883 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c[627,640] [2020-12-04 09:42:10,890 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-04 09:42:10,910 INFO L217 MainTranslator]: Completed translation [2020-12-04 09:42:10,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10 WrapperNode [2020-12-04 09:42:10,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 09:42:10,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 09:42:10,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 09:42:10,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 09:42:10,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 09:42:10,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 09:42:10,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 09:42:10,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 09:42:10,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:10,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:11,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:11,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:11,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... [2020-12-04 09:42:11,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 09:42:11,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 09:42:11,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 09:42:11,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 09:42:11,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 09:42:11,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-04 09:42:11,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-04 09:42:11,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 09:42:11,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 09:42:11,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 09:42:13,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 09:42:13,661 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-04 09:42:13,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:13 BoogieIcfgContainer [2020-12-04 09:42:13,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 09:42:13,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 09:42:13,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 09:42:13,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 09:42:13,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 09:42:10" (1/3) ... [2020-12-04 09:42:13,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8b9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 09:42:13, skipping insertion in model container [2020-12-04 09:42:13,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 09:42:10" (2/3) ... [2020-12-04 09:42:13,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8b9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 09:42:13, skipping insertion in model container [2020-12-04 09:42:13,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:13" (3/3) ... [2020-12-04 09:42:13,674 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c [2020-12-04 09:42:13,687 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 09:42:13,691 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-04 09:42:13,704 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-04 09:42:13,734 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 09:42:13,734 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 09:42:13,735 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 09:42:13,735 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 09:42:13,735 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 09:42:13,735 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 09:42:13,735 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 09:42:13,736 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 09:42:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-12-04 09:42:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-04 09:42:13,756 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:42:13,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:42:13,758 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:42:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:42:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1165686489, now seen corresponding path program 1 times [2020-12-04 09:42:13,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:42:13,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918573837] [2020-12-04 09:42:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-04 09:42:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:42:13,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-04 09:42:13,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:42:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:14,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-04 09:42:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:14,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918573837] [2020-12-04 09:42:14,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:42:14,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-04 09:42:14,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031589416] [2020-12-04 09:42:14,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 09:42:14,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-04 09:42:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 09:42:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 09:42:14,055 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-12-04 09:42:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:42:14,087 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2020-12-04 09:42:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 09:42:14,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-04 09:42:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:42:14,109 INFO L225 Difference]: With dead ends: 38 [2020-12-04 09:42:14,109 INFO L226 Difference]: Without dead ends: 16 [2020-12-04 09:42:14,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 09:42:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-04 09:42:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-04 09:42:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-04 09:42:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-12-04 09:42:14,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2020-12-04 09:42:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:42:14,161 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-12-04 09:42:14,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 09:42:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-12-04 09:42:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-04 09:42:14,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:42:14,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:42:14,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-04 09:42:14,377 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:42:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:42:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash 356339863, now seen corresponding path program 1 times [2020-12-04 09:42:14,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:42:14,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089439434] [2020-12-04 09:42:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-04 09:42:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:42:14,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-04 09:42:14,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:42:14,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:14,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:14,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:42:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:14,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-04 09:42:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:14,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089439434] [2020-12-04 09:42:14,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:42:14,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-12-04 09:42:14,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744225394] [2020-12-04 09:42:14,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 09:42:14,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-04 09:42:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 09:42:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-04 09:42:14,907 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 7 states. [2020-12-04 09:42:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:42:17,796 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2020-12-04 09:42:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 09:42:17,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-12-04 09:42:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:42:17,798 INFO L225 Difference]: With dead ends: 54 [2020-12-04 09:42:17,798 INFO L226 Difference]: Without dead ends: 40 [2020-12-04 09:42:17,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-04 09:42:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-04 09:42:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 20. [2020-12-04 09:42:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-04 09:42:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-12-04 09:42:17,804 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2020-12-04 09:42:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:42:17,805 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-12-04 09:42:17,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 09:42:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-12-04 09:42:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-04 09:42:17,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:42:17,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:42:18,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-04 09:42:18,020 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:42:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:42:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash 413598165, now seen corresponding path program 1 times [2020-12-04 09:42:18,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:42:18,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150544573] [2020-12-04 09:42:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-04 09:42:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:42:18,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-04 09:42:18,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:42:18,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:18,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:42:19,050 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-04 09:42:19,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:19,650 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-04 09:42:19,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:22,565 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-04 09:42:25,303 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 09:42:27,380 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_13 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse8 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_13))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse0 .cse1)) (= (fp.add c_~CRM .cse2 .cse3) .cse0) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse5 .cse1) (fp.leq .cse3 .cse6) (= .cse7 .cse5) (= .cse8 .cse9) (= .cse8 .cse6) (= (fp.mul c_~CRM .cse4 .cse7) .cse2) (= .cse10 (fp.neg .cse9)) (fp.geq .cse3 .cse10))))) is different from false [2020-12-04 09:42:29,489 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse1 (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_13 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse10 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse9 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse12 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse2 .cse3)) (= (fp.add c_~CRM .cse4 .cse5) .cse2) (= .cse6 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse7 .cse3) (fp.leq .cse5 .cse8) (= .cse9 .cse7) (= .cse10 .cse11) (= .cse10 .cse8) (= (fp.mul c_~CRM .cse6 .cse9) .cse4) (= .cse12 (fp.neg .cse11)) (fp.geq .cse5 .cse12)))))) (or (and .cse0 .cse1 (exists ((v_prenex_4 (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))))) (not |c_ULTIMATE.start_main_#t~short24|)) (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) |c_ULTIMATE.start_main_#t~short24|))) is different from false [2020-12-04 09:42:29,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:42:29,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:42:29,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-04 09:42:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:29,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-04 09:42:32,567 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) is different from true [2020-12-04 09:42:34,659 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-04 09:42:34,688 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-04 09:42:34,691 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-04 09:42:36,759 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-12-04 09:42:38,836 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse2)) (not (fp.geq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse1)) (not (= .cse5 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse3 .cse5) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-12-04 09:42:40,934 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet12_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~E0~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet12_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet12_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet12_6|))) (.cse1 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_6|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~E0~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~E0~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~E0~0_8))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= .cse0 .cse1)) (not (fp.geq .cse2 .cse3)) (not (= (fp.neg .cse4) .cse3)) (not (= (fp.add c_~CRM .cse5 .cse2) .cse6)) (not (= .cse1 .cse4)) (not (fp.geq .cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse5)) (not (= .cse9 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse7 .cse9) (not (fp.leq .cse2 .cse0)) (not (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse7))))) is different from true [2020-12-04 09:42:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:42:41,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150544573] [2020-12-04 09:42:41,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:42:41,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2020-12-04 09:42:41,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750978276] [2020-12-04 09:42:41,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-04 09:42:41,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-04 09:42:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-04 09:42:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=118, Unknown=9, NotChecked=196, Total=380 [2020-12-04 09:42:41,441 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 20 states. [2020-12-04 09:42:46,391 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (not |c_ULTIMATE.start_main_#t~short14|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse2)) (not (fp.geq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse1)) (not (= .cse5 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse3 .cse5) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3))))) .cse6) (let ((.cse14 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (let ((.cse9 (= roundNearestTiesToEven c_~CRM)) (.cse10 (= .cse14 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0)))) (.cse11 (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse14))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7) (= .cse8 (fp.neg .cse7)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse8)))) .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_#t~short14|) (and .cse9 (exists ((|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|))) (.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|)))) (and (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse12)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse13) (= .cse12 (fp.neg .cse13))))) .cse10 .cse11 .cse6)))))) is different from true [2020-12-04 09:42:48,477 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (not |c_ULTIMATE.start_main_#t~short14|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) .cse5) (let ((.cse12 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (let ((.cse6 (exists ((|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse14 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse13) (= .cse14 (fp.neg .cse13)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse14))))) (.cse7 (= roundNearestTiesToEven c_~CRM)) (.cse9 (= .cse12 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0)))) (.cse10 (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse12))) (or (and .cse6 .cse7 (exists ((|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|)))) (and (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse8)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse8)))) .cse9 .cse10 .cse5) (and .cse6 (exists ((|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse11) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse11)))) .cse7 .cse9 .cse10 |c_ULTIMATE.start_main_#t~short14|)))))) is different from true [2020-12-04 09:42:55,526 WARN L197 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 54 [2020-12-04 09:43:00,366 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|))))) (forall ((|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|)))) (or (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse0) (not (= .cse0 ((_ to_fp 11 53) c_~CRM 10000.0))))))) (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_13 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse9 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse1 .cse2)) (= (fp.add c_~CRM .cse3 .cse4) .cse1) (= .cse5 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse6 .cse2) (fp.leq .cse4 .cse7) (= .cse8 .cse6) (= .cse9 .cse10) (= .cse9 .cse7) (= (fp.mul c_~CRM .cse5 .cse8) .cse3) (= .cse11 (fp.neg .cse10)) (fp.geq .cse4 .cse11))))) is different from false [2020-12-04 09:43:00,745 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 09:43:01,121 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2020-12-04 09:43:03,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (not |c_ULTIMATE.start_main_#t~short24|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|)))) (or (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse0) (not (= .cse0 ((_ to_fp 11 53) c_~CRM 10000.0)))))) .cse1) (let ((.cse2 (= roundNearestTiesToEven c_~CRM)) (.cse3 (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_13 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse9 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse12 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_13))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse14 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse4 .cse5)) (= (fp.add c_~CRM .cse6 .cse7) .cse4) (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse9 .cse5) (fp.leq .cse7 .cse10) (= .cse11 .cse9) (= .cse12 .cse13) (= .cse12 .cse10) (= (fp.mul c_~CRM .cse8 .cse11) .cse6) (= .cse14 (fp.neg .cse13)) (fp.geq .cse7 .cse14)))))) (or (and .cse2 .cse3 (exists ((v_prenex_4 (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))))) .cse1) (and .cse2 .cse3 (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) |c_ULTIMATE.start_main_#t~short24|))))) is different from false [2020-12-04 09:43:03,651 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2020-12-04 09:43:04,043 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-12-04 09:43:04,516 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-12-04 09:43:04,864 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-04 09:43:05,325 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-04 09:43:05,781 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-04 09:43:06,924 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-04 09:43:07,469 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2020-12-04 09:43:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:43:07,532 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2020-12-04 09:43:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-04 09:43:07,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 13 [2020-12-04 09:43:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:43:07,540 INFO L225 Difference]: With dead ends: 78 [2020-12-04 09:43:07,541 INFO L226 Difference]: Without dead ends: 76 [2020-12-04 09:43:07,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=175, Invalid=456, Unknown=13, NotChecked=616, Total=1260 [2020-12-04 09:43:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-04 09:43:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2020-12-04 09:43:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-04 09:43:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-12-04 09:43:07,562 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2020-12-04 09:43:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:43:07,563 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-12-04 09:43:07,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-04 09:43:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-12-04 09:43:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-04 09:43:07,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:43:07,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:43:07,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-04 09:43:07,779 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:43:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:43:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 413657747, now seen corresponding path program 1 times [2020-12-04 09:43:07,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:43:07,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559671405] [2020-12-04 09:43:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-04 09:43:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:43:08,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-04 09:43:08,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:43:08,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:43:08,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:43:08,994 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-04 09:43:08,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:43:09,687 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-04 09:43:09,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:43:15,238 WARN L197 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-04 09:43:18,165 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 09:43:20,246 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse7 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_16))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse0 .cse1)) (= .cse0 (fp.add c_~CRM .cse2 .cse3)) (= .cse4 .cse5) (= .cse4 .cse1) (fp.leq .cse3 .cse6) (= .cse7 .cse8) (= .cse7 .cse6) (= .cse2 (fp.mul c_~CRM .cse9 .cse5)) (= .cse10 (fp.neg .cse8)) (fp.geq .cse3 .cse10) (= .cse9 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))))))) is different from false [2020-12-04 09:43:20,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:43:20,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:43:20,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-04 09:43:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:43:20,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-04 09:43:22,710 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (or (not (= .cse0 (fp.neg .cse1))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= .cse2 (fp.add c_~CRM .cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))))) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse1)) (fp.geq .cse3 .cse0) (not (= .cse5 (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)))))))) is different from true [2020-12-04 09:43:24,802 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (or (not (= .cse0 (fp.neg .cse1))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= .cse2 (fp.add c_~CRM .cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))))) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse1)) (fp.geq .cse3 .cse0) (not (= .cse5 (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-04 09:43:24,813 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-04 09:43:24,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-04 09:43:26,885 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (or (not (= .cse0 (fp.neg .cse1))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= .cse2 (fp.add c_~CRM .cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))))) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse1)) (fp.geq .cse3 .cse0) (not (= .cse5 (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)))))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-12-04 09:43:28,979 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (or (not (= .cse1 (fp.neg .cse2))) (not (= (fp.sub c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse4)) (not (= .cse5 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= .cse3 (fp.add c_~CRM .cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))))) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse2)) (fp.geq .cse4 .cse1) (not (= .cse6 (fp.mul c_~CRM .cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)))))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-12-04 09:43:31,090 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~E0~0_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet12_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet12_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet12_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet12_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|))) (.cse10 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_9|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~E0~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~E0~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~E0~0_10))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (or (not (= .cse0 (fp.neg .cse1))) (not (= .cse2 (fp.neg .cse3))) (not (= .cse4 (fp.add c_~CRM .cse5 .cse6))) (not (= (fp.sub c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse7)) (not (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (fp.geq .cse6 .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse1)) (not (= .cse9 .cse10)) (not (= .cse10 .cse3)) (not (fp.leq .cse6 .cse9)) (fp.geq .cse7 .cse0) (not (= .cse5 (fp.mul c_~CRM .cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)))))))) is different from true [2020-12-04 09:43:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:43:31,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559671405] [2020-12-04 09:43:31,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:43:31,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-12-04 09:43:31,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954215564] [2020-12-04 09:43:31,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-04 09:43:31,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-04 09:43:31,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-04 09:43:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=62, Unknown=9, NotChecked=126, Total=240 [2020-12-04 09:43:31,508 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 16 states. [2020-12-04 09:43:37,705 WARN L197 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 114 DAG size of output: 48 [2020-12-04 09:43:47,592 WARN L197 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 145 DAG size of output: 75 [2020-12-04 09:43:49,716 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 150 DAG size of output: 56 [2020-12-04 09:43:58,228 WARN L197 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 136 DAG size of output: 54 [2020-12-04 09:44:03,197 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse7 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet13|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_16))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse0 .cse1)) (= .cse0 (fp.add c_~CRM .cse2 .cse3)) (= .cse4 .cse5) (= .cse4 .cse1) (fp.leq .cse3 .cse6) (= .cse7 .cse8) (= .cse7 .cse6) (= .cse2 (fp.mul c_~CRM .cse9 .cse5)) (= .cse10 (fp.neg .cse8)) (fp.geq .cse3 .cse10) (= .cse9 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet22_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet21_8| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_8|))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet21_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet21_8|)))) (or (not (= .cse11 (fp.neg .cse12))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse11) (not (= ((_ to_fp 11 53) c_~CRM 10000.0) .cse12)))))) is different from false [2020-12-04 09:44:03,633 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-04 09:44:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:44:06,948 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2020-12-04 09:44:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 09:44:06,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-12-04 09:44:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:44:06,951 INFO L225 Difference]: With dead ends: 75 [2020-12-04 09:44:06,951 INFO L226 Difference]: Without dead ends: 57 [2020-12-04 09:44:06,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=97, Invalid=160, Unknown=11, NotChecked=238, Total=506 [2020-12-04 09:44:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-04 09:44:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 26. [2020-12-04 09:44:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-04 09:44:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-12-04 09:44:06,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 13 [2020-12-04 09:44:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:44:06,959 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-12-04 09:44:06,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-04 09:44:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-12-04 09:44:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-04 09:44:06,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:44:06,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:44:07,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-04 09:44:07,175 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:44:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:44:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash 20571155, now seen corresponding path program 1 times [2020-12-04 09:44:07,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:44:07,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429296002] [2020-12-04 09:44:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-04 09:44:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:44:07,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-04 09:44:07,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:44:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:44:07,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-04 09:44:07,755 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-04 09:44:07,755 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-04 09:44:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 09:44:07,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429296002] [2020-12-04 09:44:07,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:44:07,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-04 09:44:07,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762702793] [2020-12-04 09:44:07,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 09:44:07,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-04 09:44:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 09:44:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 09:44:07,762 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2020-12-04 09:44:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 09:44:08,023 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-12-04 09:44:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 09:44:08,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-04 09:44:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 09:44:08,025 INFO L225 Difference]: With dead ends: 46 [2020-12-04 09:44:08,025 INFO L226 Difference]: Without dead ends: 26 [2020-12-04 09:44:08,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 09:44:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-04 09:44:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-04 09:44:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-04 09:44:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-04 09:44:08,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2020-12-04 09:44:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 09:44:08,031 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-04 09:44:08,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 09:44:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-04 09:44:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 09:44:08,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 09:44:08,032 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 09:44:08,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-04 09:44:08,245 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 09:44:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 09:44:08,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1933515933, now seen corresponding path program 1 times [2020-12-04 09:44:08,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-04 09:44:08,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11968072] [2020-12-04 09:44:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-04 09:44:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:44:08,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-04 09:44:08,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:44:09,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:09,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:44:09,417 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-04 09:44:09,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:09,985 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 09:44:09,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:13,079 WARN L197 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-12-04 09:44:15,948 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-04 09:44:16,362 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-04 09:44:16,765 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-04 09:44:16,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:16,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:44:18,177 WARN L197 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-12-04 09:44:18,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:19,995 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 81 [2020-12-04 09:44:20,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:31,695 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 131 [2020-12-04 09:44:35,211 WARN L197 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-04 09:44:37,310 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_12| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse2 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse8 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse7 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse9 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse11 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_12|))) (.cse12 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_20))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_12|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_12|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0)))) (and (= .cse0 .cse1) (= .cse2 (fp.neg .cse3)) (= .cse3 .cse0) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse4 .cse5)) (fp.leq .cse6 .cse7) (fp.geq .cse6 .cse8) (fp.geq .cse5 .cse2) (= .cse0 .cse9) (= (fp.neg .cse1) .cse8) (= .cse10 (fp.mul c_~CRM .cse11 .cse12)) (= .cse7 .cse0) (fp.leq .cse5 .cse9) (= .cse11 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse12 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (= .cse4 (fp.add c_~CRM .cse10 .cse6)))))) is different from false [2020-12-04 09:44:39,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse1 (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_12| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse3 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse10 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse9 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse2 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse11 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse13 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_12|))) (.cse14 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_12|))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_12|))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0)))) (and (= .cse2 .cse3) (= .cse4 (fp.neg .cse5)) (= .cse5 .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse6 .cse7)) (fp.leq .cse8 .cse9) (fp.geq .cse8 .cse10) (fp.geq .cse7 .cse4) (= .cse2 .cse11) (= (fp.neg .cse3) .cse10) (= .cse12 (fp.mul c_~CRM .cse13 .cse14)) (= .cse9 .cse2) (fp.leq .cse7 .cse11) (= .cse13 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse14 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (= .cse6 (fp.add c_~CRM .cse12 .cse8))))))) (or (and .cse0 .cse1 (exists ((v_prenex_17 (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (not |c_ULTIMATE.start_main_#t~short24|)) (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) |c_ULTIMATE.start_main_#t~short24|))) is different from false [2020-12-04 09:44:39,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:39,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:44:39,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2020-12-04 09:44:46,803 WARN L860 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short24| (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_12| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_12|))) (.cse10 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse5 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse11 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_12|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_20))) (.cse6 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse13 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_12|))) (.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (= .cse3 (fp.add roundNearestTiesToEven .cse0 .cse4)) (= .cse5 (fp.neg .cse6)) (= .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (fp.geq .cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (= .cse9 .cse10) (fp.leq .cse4 .cse10) (fp.geq .cse4 .cse11) (fp.geq .cse12 .cse5) (= (fp.neg .cse13) .cse11) (not (fp.leq .cse8 .cse7)) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (fp.leq .cse12 .cse14) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= .cse6 .cse9) (= .cse9 .cse13) (= .cse8 (fp.sub roundNearestTiesToEven .cse3 .cse12)) (= .cse9 .cse14))))) is different from true [2020-12-04 09:44:46,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:48,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11968072] [2020-12-04 09:44:48,889 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-04 09:44:48,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1400630794] [2020-12-04 09:44:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt [2020-12-04 09:44:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:44:50,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-04 09:44:50,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:44:50,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:50,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:44:50,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:50,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:52,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:53,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:44:53,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:44:54,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:10,169 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_21 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse3 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse8 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse7 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse2 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse10 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_13|))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_21))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse0 .cse1)) (= .cse2 .cse3) (= .cse4 (fp.neg .cse5)) (= .cse5 .cse2) (fp.leq .cse6 .cse7) (fp.geq .cse6 .cse8) (fp.geq .cse1 .cse4) (= .cse9 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse2 .cse10) (= (fp.neg .cse3) .cse8) (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse11) (= .cse7 .cse2) (fp.leq .cse1 .cse10) (= (fp.add c_~CRM .cse12 .cse6) .cse0) (= (fp.mul c_~CRM .cse9 .cse11) .cse12)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-04 09:45:10,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:10,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:45:12,289 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_21 (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse10 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse9 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse14 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse13 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse8 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse16 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|))) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_13|))) (.cse17 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_21))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse6 .cse7)) (= .cse8 .cse9) (= .cse10 (fp.neg .cse11)) (= .cse11 .cse8) (fp.leq .cse12 .cse13) (fp.geq .cse12 .cse14) (fp.geq .cse7 .cse10) (= .cse15 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse8 .cse16) (= (fp.neg .cse9) .cse14) (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse17) (= .cse13 .cse8) (fp.leq .cse7 .cse16) (= (fp.add c_~CRM .cse18 .cse12) .cse6) (= (fp.mul c_~CRM .cse15 .cse17) .cse18))))) (.cse1 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|)))) (and (= .cse2 (fp.neg .cse3)) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse2)) (= .cse3 ((_ to_fp 11 53) c_~CRM 10000.0))))) (not |c_ULTIMATE.start_main_#t~short24|)) (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) (and (= .cse4 (fp.neg .cse5)) (= .cse5 ((_ to_fp 11 53) c_~CRM 10000.0)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse4)))) .cse1 |c_ULTIMATE.start_main_#t~short24|))) is different from false [2020-12-04 09:45:12,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:12,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:45:12,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2020-12-04 09:45:19,589 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_21 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (.cse13 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse2 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse14 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|))) (.cse10 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_21))) (.cse15 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse3 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse16 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_13|))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse17 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse0 (fp.neg .cse1)) (= .cse2 (fp.neg .cse3)) (= .cse4 (fp.add roundNearestTiesToEven .cse5 .cse6)) (= .cse7 .cse8) (= (fp.mul roundNearestTiesToEven .cse9 .cse10) .cse5) (fp.geq .cse11 .cse0) (= .cse12 .cse13) (fp.leq .cse6 .cse13) (fp.geq .cse6 .cse14) (fp.geq .cse15 .cse2) (= (fp.neg .cse16) .cse14) (not (fp.leq .cse11 .cse7)) (= .cse1 .cse8) (= .cse11 (fp.sub roundNearestTiesToEven .cse4 .cse15)) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse10) (fp.leq .cse15 .cse17) (= .cse3 .cse12) (= .cse12 .cse16) (= .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (= .cse12 .cse17)))) |c_ULTIMATE.start_main_#t~short24|) is different from false [2020-12-04 09:45:21,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:23,413 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-04 09:45:23,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620269793] [2020-12-04 09:45:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 09:45:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 09:45:30,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-04 09:45:30,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 09:45:30,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:30,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:45:30,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:30,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:32,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:32,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:45:33,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:34,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:53,004 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_22 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse1 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse11 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_14|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_22))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse10 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse0 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse12 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse3) (= .cse4 (fp.neg .cse5)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse6 .cse7)) (= .cse5 .cse0) (= (fp.add c_~CRM .cse8 .cse9) .cse6) (fp.leq .cse9 .cse10) (fp.geq .cse9 .cse11) (fp.geq .cse7 .cse4) (= .cse0 .cse12) (= (fp.neg .cse1) .cse11) (= (fp.mul c_~CRM .cse2 .cse3) .cse8) (= .cse10 .cse0) (fp.leq .cse7 .cse12)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-04 09:45:55,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_22 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse6 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse3 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse13 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_14|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_22))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse12 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse2 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse9 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse14 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse5) (= .cse6 (fp.neg .cse7)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse8 .cse9)) (= .cse7 .cse2) (= (fp.add c_~CRM .cse10 .cse11) .cse8) (fp.leq .cse11 .cse12) (fp.geq .cse11 .cse13) (fp.geq .cse9 .cse6) (= .cse2 .cse14) (= (fp.neg .cse3) .cse13) (= (fp.mul c_~CRM .cse4 .cse5) .cse10) (= .cse12 .cse2) (fp.leq .cse9 .cse14))))) (.cse1 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) |c_ULTIMATE.start_main_#t~short24|) (and .cse0 .cse1 (exists ((v_prenex_36 (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) v_prenex_36) ((_ extract 62 52) v_prenex_36) ((_ extract 51 0) v_prenex_36))))) (not |c_ULTIMATE.start_main_#t~short24|)))) is different from false [2020-12-04 09:45:55,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:45:55,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-04 09:45:55,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2020-12-04 09:46:02,628 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_22 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_14|))) (.cse10 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse12 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse5 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse13 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_22))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (= (fp.sub roundNearestTiesToEven .cse1 .cse2) .cse3) (= .cse4 (fp.neg .cse5)) (= .cse6 (fp.mul roundNearestTiesToEven .cse0 .cse7)) (= .cse8 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (fp.geq .cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (= .cse9 .cse10) (fp.leq .cse11 .cse10) (fp.geq .cse11 .cse12) (fp.geq .cse2 .cse4) (= (fp.neg .cse13) .cse12) (not (fp.leq .cse3 .cse8)) (= (fp.add roundNearestTiesToEven .cse6 .cse11) .cse1) (fp.leq .cse2 .cse14) (= .cse5 .cse9) (= .cse9 .cse13) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse7) (= .cse9 .cse14)))) |c_ULTIMATE.start_main_#t~short24|) is different from false [2020-12-04 09:46:04,642 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_22 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_14|))) (.cse10 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse12 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse8 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse5 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse13 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_22))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (= (fp.sub roundNearestTiesToEven .cse1 .cse2) .cse3) (= .cse4 (fp.neg .cse5)) (= .cse6 (fp.mul roundNearestTiesToEven .cse0 .cse7)) (= .cse8 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (fp.geq .cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (= .cse9 .cse10) (fp.leq .cse11 .cse10) (fp.geq .cse11 .cse12) (fp.geq .cse2 .cse4) (= (fp.neg .cse13) .cse12) (not (fp.leq .cse3 .cse8)) (= (fp.add roundNearestTiesToEven .cse6 .cse11) .cse1) (fp.leq .cse2 .cse14) (= .cse5 .cse9) (= .cse9 .cse13) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse7) (= .cse9 .cse14)))) |c_ULTIMATE.start_main_#t~short24|) is different from true [2020-12-04 09:46:04,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 09:46:06,730 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-04 09:46:06,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-04 09:46:06,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-04 09:46:06,731 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-12-04 09:46:06,731 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-04 09:46:07,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt [2020-12-04 09:46:07,359 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-04 09:46:07,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 09:46:07 BoogieIcfgContainer [2020-12-04 09:46:07,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 09:46:07,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 09:46:07,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 09:46:07,361 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 09:46:07,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 09:42:13" (3/4) ... [2020-12-04 09:46:07,364 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-04 09:46:07,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 09:46:07,366 INFO L168 Benchmark]: Toolchain (without parser) took 236852.11 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.2 MB in the beginning and 29.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-12-04 09:46:07,366 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 46.1 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:46:07,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.03 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 21.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-04 09:46:07,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 19.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-04 09:46:07,369 INFO L168 Benchmark]: Boogie Preprocessor took 77.24 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 40.5 MB in the end (delta: -20.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-12-04 09:46:07,369 INFO L168 Benchmark]: RCFGBuilder took 2622.20 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 25.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-04 09:46:07,370 INFO L168 Benchmark]: TraceAbstraction took 233695.02 ms. Allocated memory is still 56.6 MB. Free memory was 24.9 MB in the beginning and 29.8 MB in the end (delta: -4.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:46:07,371 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 29.6 MB in the end (delta: 133.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 09:46:07,375 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.55 ms. Allocated memory is still 46.1 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 395.03 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 21.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 46.1 MB. Free memory was 21.3 MB in the beginning and 19.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.24 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 40.5 MB in the end (delta: -20.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2622.20 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 25.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 233695.02 ms. Allocated memory is still 56.6 MB. Free memory was 24.9 MB in the beginning and 29.8 MB in the end (delta: -4.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.21 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 29.6 MB in the end (delta: 133.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] EXPR 1. [L31] EXPR -1. [L31] E0 >= -1. && E0 <= 1. [L31] EXPR 1. [L31] E0 >= -1. && E0 <= 1. [L15] COND FALSE !(!cond) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L41] EXPR 10000. [L41] EXPR -10000. [L41] S >= -10000. && S <= 10000. [L41] EXPR 10000. [L41] S >= -10000. && S <= 10000. [L17] COND FALSE !(!(cond)) [L28] i++ [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] EXPR 1. [L31] EXPR -1. [L31] E0 >= -1. && E0 <= 1. [L31] EXPR 1. [L31] E0 >= -1. && E0 <= 1. [L15] COND FALSE !(!cond) [L33] COND FALSE !(__VERIFIER_nondet_int()) [L37] EXPR 0.999 [L37] EXPR 0.999 * S [L37] EXPR 0.999 * S + E0 [L37] EXPR 0.999 * S + E0 - E1 [L37] S = 0.999 * S + E0 - E1 [L39] E1 = E0 [L41] EXPR 10000. [L41] EXPR -10000. [L41] S >= -10000. && S <= 10000. [L41] EXPR 10000. [L41] S >= -10000. && S <= 10000. [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 233.6s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 64.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 81 SDtfs, 210 SDslu, 259 SDs, 0 SdLazy, 249 SolverSat, 62 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 18 IntricatePredicates, 1 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 96.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=3, 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, 5 MinimizatonAttempts, 99 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 46.6s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 120 ConstructedInterpolants, 30 QuantifiedInterpolants, 53136 SizeOfPredicates, 34 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...