./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 88b5e43d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47ed977f76c934f7398d12ebfeb1101009979bf5 .............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47ed977f76c934f7398d12ebfeb1101009979bf5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:52:54,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:52:54,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:52:54,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:52:54,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:52:54,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:52:54,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:52:54,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:52:54,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:52:54,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:52:54,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:52:54,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:52:54,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:52:54,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:52:54,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:52:54,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:52:54,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:52:54,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:52:54,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:52:54,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:52:54,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:52:54,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:52:54,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:52:54,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:52:54,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:52:54,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:52:54,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:52:54,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:52:54,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:52:54,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:52:54,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:52:54,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:52:54,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:52:54,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:52:54,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:52:54,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:52:54,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:52:54,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:52:54,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:52:54,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:52:54,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:52:54,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 23:52:54,634 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:52:54,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:52:54,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:52:54,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:52:54,636 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:52:54,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:52:54,637 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:52:54,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 23:52:54,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:52:54,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:52:54,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:52:54,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:52:54,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:52:54,639 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:52:54,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:52:54,639 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:52:54,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:52:54,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:52:54,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:52:54,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:52:54,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:52:54,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:52:54,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:52:54,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:52:54,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:52:54,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 23:52:54,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 23:52:54,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:52:54,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:52:54,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-11-23 23:52:55,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:52:55,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:52:55,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:52:55,084 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:52:55,087 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:52:55,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:52:55,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7252c458/7441730354794679bbe2635592318354/FLAGabf8a51ac [2020-11-23 23:52:55,797 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:52:55,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:52:55,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7252c458/7441730354794679bbe2635592318354/FLAGabf8a51ac [2020-11-23 23:52:56,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7252c458/7441730354794679bbe2635592318354 [2020-11-23 23:52:56,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:52:56,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:52:56,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:52:56,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:52:56,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:52:56,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdfd4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56, skipping insertion in model container [2020-11-23 23:52:56,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,212 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:52:56,244 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:52:56,412 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:52:56,423 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:52:56,441 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:52:56,457 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:52:56,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56 WrapperNode [2020-11-23 23:52:56,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:52:56,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:52:56,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:52:56,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:52:56,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:52:56,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:52:56,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:52:56,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:52:56,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... [2020-11-23 23:52:56,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:52:56,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:52:56,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:52:56,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:52:56,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:52:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:52:56,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:52:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 23:52:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:52:56,802 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:52:56,803 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:52:56,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:56 BoogieIcfgContainer [2020-11-23 23:52:56,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:52:56,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:52:56,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:52:56,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:52:56,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:52:56" (1/3) ... [2020-11-23 23:52:56,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4b1eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:52:56, skipping insertion in model container [2020-11-23 23:52:56,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:56" (2/3) ... [2020-11-23 23:52:56,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4b1eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:52:56, skipping insertion in model container [2020-11-23 23:52:56,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:56" (3/3) ... [2020-11-23 23:52:56,822 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:52:56,848 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:52:56,863 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:52:56,894 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:52:56,957 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:52:56,960 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:52:56,960 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:52:56,961 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:52:56,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:52:56,963 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:52:56,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:52:56,964 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:52:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 23:52:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 23:52:57,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:52:57,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 23:52:57,006 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:52:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:52:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 23:52:57,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 23:52:57,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639047705] [2020-11-23 23:52:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 23:52:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:52:57,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:52:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:52:57,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:52:57,208 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 23:52:57,209 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 23:52:57,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 23:52:57,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:52:57 BoogieIcfgContainer [2020-11-23 23:52:57,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 23:52:57,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 23:52:57,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 23:52:57,239 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 23:52:57,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:56" (3/4) ... [2020-11-23 23:52:57,244 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 23:52:57,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 23:52:57,247 INFO L168 Benchmark]: Toolchain (without parser) took 1086.96 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 28.5 MB in the end (delta: -10.3 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:57,248 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 26.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:57,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.67 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.5 MB in the beginning and 27.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:57,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.71 ms. Allocated memory is still 52.4 MB. Free memory was 27.9 MB in the beginning and 26.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:57,252 INFO L168 Benchmark]: Boogie Preprocessor took 21.55 ms. Allocated memory is still 52.4 MB. Free memory was 26.5 MB in the beginning and 25.7 MB in the end (delta: 854.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:57,253 INFO L168 Benchmark]: RCFGBuilder took 285.56 ms. Allocated memory is still 52.4 MB. Free memory was 25.5 MB in the beginning and 27.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:57,254 INFO L168 Benchmark]: TraceAbstraction took 430.57 ms. Allocated memory is still 52.4 MB. Free memory was 26.9 MB in the beginning and 28.9 MB in the end (delta: -2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:57,255 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 52.4 MB. Free memory was 28.7 MB in the beginning and 28.5 MB in the end (delta: 235.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:57,260 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.31 ms. Allocated memory is still 41.9 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 26.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 292.67 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.5 MB in the beginning and 27.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.71 ms. Allocated memory is still 52.4 MB. Free memory was 27.9 MB in the beginning and 26.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.55 ms. Allocated memory is still 52.4 MB. Free memory was 26.5 MB in the beginning and 25.7 MB in the end (delta: 854.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 285.56 ms. Allocated memory is still 52.4 MB. Free memory was 25.5 MB in the beginning and 27.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 430.57 ms. Allocated memory is still 52.4 MB. Free memory was 26.9 MB in the beginning and 28.9 MB in the end (delta: -2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.45 ms. Allocated memory is still 52.4 MB. Free memory was 28.7 MB in the beginning and 28.5 MB in the end (delta: 235.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 10, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 1.6; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L4] __assert_fail("0", "Double_div_bad.i.p+cfa-reducer.c", 4, "reach_error") VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:52:59,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:52:59,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:52:59,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:52:59,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:52:59,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:52:59,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:52:59,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:52:59,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:52:59,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:52:59,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:52:59,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:52:59,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:52:59,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:52:59,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:52:59,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:53:00,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:53:00,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:53:00,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:53:00,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:53:00,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:53:00,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:53:00,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:53:00,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:53:00,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:53:00,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:53:00,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:53:00,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:53:00,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:53:00,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:53:00,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:53:00,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:53:00,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:53:00,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:53:00,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:53:00,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:53:00,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:53:00,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:53:00,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:53:00,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:53:00,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:53:00,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 23:53:00,072 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:53:00,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:53:00,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:53:00,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:53:00,075 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:53:00,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:53:00,076 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:53:00,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:53:00,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:53:00,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:53:00,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:53:00,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:53:00,077 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 23:53:00,077 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 23:53:00,078 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:53:00,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:53:00,078 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:53:00,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:53:00,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:53:00,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:53:00,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:53:00,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:53:00,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:53:00,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:53:00,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:53:00,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:53:00,081 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 23:53:00,081 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 23:53:00,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:53:00,082 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:53:00,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 23:53:00,082 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-11-23 23:53:00,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:53:00,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:53:00,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:53:00,505 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:53:00,506 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:53:00,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:53:00,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69ea6aa/b72210d99f2c4c9ebc6d3c2c2ae622e2/FLAG2ac6bb5ba [2020-11-23 23:53:01,284 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:53:01,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:53:01,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69ea6aa/b72210d99f2c4c9ebc6d3c2c2ae622e2/FLAG2ac6bb5ba [2020-11-23 23:53:01,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8b69ea6aa/b72210d99f2c4c9ebc6d3c2c2ae622e2 [2020-11-23 23:53:01,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:53:01,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:53:01,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:53:01,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:53:01,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:53:01,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:01" (1/1) ... [2020-11-23 23:53:01,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48821e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:01, skipping insertion in model container [2020-11-23 23:53:01,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:01" (1/1) ... [2020-11-23 23:53:01,696 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:53:01,715 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:53:01,940 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:53:01,957 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:53:01,975 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:53:02,003 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:53:02,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02 WrapperNode [2020-11-23 23:53:02,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:53:02,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:53:02,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:53:02,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:53:02,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:53:02,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:53:02,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:53:02,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:53:02,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... [2020-11-23 23:53:02,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:53:02,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:53:02,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:53:02,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:53:02,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:53:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-11-23 23:53:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 23:53:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:53:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:53:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:53:04,793 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:53:04,794 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:53:04,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:04 BoogieIcfgContainer [2020-11-23 23:53:04,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:53:04,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:53:04,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:53:04,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:53:04,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:53:01" (1/3) ... [2020-11-23 23:53:04,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab11dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:53:04, skipping insertion in model container [2020-11-23 23:53:04,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:02" (2/3) ... [2020-11-23 23:53:04,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab11dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:53:04, skipping insertion in model container [2020-11-23 23:53:04,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:04" (3/3) ... [2020-11-23 23:53:04,805 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-11-23 23:53:04,818 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:53:04,824 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:53:04,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:53:04,872 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:53:04,872 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:53:04,873 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:53:04,873 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:53:04,873 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:53:04,873 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:53:04,873 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:53:04,874 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:53:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 23:53:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 23:53:04,901 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:53:04,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 23:53:04,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:53:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:53:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 23:53:04,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:53:04,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453990058] [2020-11-23 23:53:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-23 23:53:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:53:06,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 23:53:06,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:53:08,343 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0))) is different from true [2020-11-23 23:53:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:53:08,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:53:10,603 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_7 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_7 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_7))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_7)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0))))) is different from true [2020-11-23 23:53:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:53:10,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453990058] [2020-11-23 23:53:10,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:53:10,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-23 23:53:10,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623403659] [2020-11-23 23:53:10,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-23 23:53:10,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:53:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-23 23:53:10,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2020-11-23 23:53:10,631 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 6 states. [2020-11-23 23:53:19,073 WARN L193 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2020-11-23 23:53:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:53:23,350 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-11-23 23:53:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 23:53:23,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-11-23 23:53:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:53:23,362 INFO L225 Difference]: With dead ends: 18 [2020-11-23 23:53:23,363 INFO L226 Difference]: Without dead ends: 8 [2020-11-23 23:53:23,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=18, Invalid=18, Unknown=2, NotChecked=18, Total=56 [2020-11-23 23:53:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-23 23:53:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-23 23:53:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-23 23:53:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-23 23:53:23,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2020-11-23 23:53:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:53:23,402 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-23 23:53:23,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-23 23:53:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-23 23:53:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-23 23:53:23,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:53:23,404 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-11-23 23:53:23,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 23:53:23,621 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:53:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:53:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 1 times [2020-11-23 23:53:23,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:53:23,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860238491] [2020-11-23 23:53:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-23 23:53:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:53:26,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-23 23:53:26,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:53:32,527 WARN L193 SmtUtils]: Spent 4.49 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:53:34,806 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= (fp.div c_~CRM .cse2 .cse1) .cse0))))) is different from false [2020-11-23 23:53:37,226 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (fp.div roundNearestTiesToEven .cse2 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))))) is different from false [2020-11-23 23:53:39,350 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (fp.div roundNearestTiesToEven .cse2 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))))) is different from true [2020-11-23 23:53:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-23 23:53:39,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:53:42,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0))))) is different from false [2020-11-23 23:53:46,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10)))) (or (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse0) .cse1)) (not (fp.eq .cse2 .cse1)) (not (= (fp.div c_~CRM .cse1 .cse0) .cse2))))) is different from false [2020-11-23 23:53:48,736 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10)))) (or (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse0) .cse1)) (not (fp.eq .cse2 .cse1)) (not (= (fp.div c_~CRM .cse1 .cse0) .cse2))))) is different from true [2020-11-23 23:53:51,185 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_12 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_12))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM .cse0 .cse2))) (not (= .cse1 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.eq .cse4 .cse3)) (not (= (fp.div c_~CRM .cse3 .cse2) .cse4))))) is different from true [2020-11-23 23:53:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-23 23:53:51,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860238491] [2020-11-23 23:53:51,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:53:51,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-11-23 23:53:51,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129326609] [2020-11-23 23:53:51,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-23 23:53:51,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:53:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-23 23:53:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=15, Unknown=7, NotChecked=50, Total=90 [2020-11-23 23:53:51,192 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2020-11-23 23:53:58,726 WARN L193 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 43 [2020-11-23 23:54:17,349 WARN L193 SmtUtils]: Spent 12.33 s on a formula simplification that was a NOOP. DAG size: 45 [2020-11-23 23:54:22,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse4 .cse3) .cse2))))) is different from false [2020-11-23 23:54:25,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (fp.div roundNearestTiesToEven .cse2 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) (= .cse3 (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (not (fp.eq .cse3 .cse4)))) is different from false [2020-11-23 23:54:28,135 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (fp.div roundNearestTiesToEven .cse2 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0)))) (= .cse3 (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (not (fp.eq .cse3 .cse4)))) is different from true [2020-11-23 23:54:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:54:34,791 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-11-23 23:54:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 23:54:34,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2020-11-23 23:54:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:54:34,792 INFO L225 Difference]: With dead ends: 12 [2020-11-23 23:54:34,792 INFO L226 Difference]: Without dead ends: 9 [2020-11-23 23:54:34,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=30, Invalid=27, Unknown=13, NotChecked=112, Total=182 [2020-11-23 23:54:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-11-23 23:54:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-23 23:54:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-23 23:54:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-11-23 23:54:34,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-11-23 23:54:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:54:34,798 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-11-23 23:54:34,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-23 23:54:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-11-23 23:54:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-23 23:54:34,799 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:54:34,799 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-11-23 23:54:35,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 23:54:35,001 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:54:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:54:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2020-11-23 23:54:35,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:54:35,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520173649] [2020-11-23 23:54:35,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-23 23:54:38,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-23 23:54:38,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 23:54:38,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-23 23:54:38,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:54:40,873 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-11-23 23:54:43,261 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2))))) is different from false [2020-11-23 23:54:45,699 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse0 (fp.div c_~CRM .cse3 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3))))) is different from false [2020-11-23 23:54:48,303 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3))))) is different from false [2020-11-23 23:54:50,502 WARN L860 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3))))) is different from true [2020-11-23 23:54:50,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-23 23:54:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-11-23 23:54:55,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:54:58,201 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0)))))) is different from true [2020-11-23 23:55:00,539 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:55:03,028 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_18))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= .cse0 (fp.div c_~CRM .cse3 .cse1))) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse3)) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:55:05,749 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_19 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_19))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_18))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= .cse0 (fp.div c_~CRM .cse3 .cse1))) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM .cse4 .cse1) .cse5)) (not (= (fp.div c_~CRM .cse5 .cse1) .cse3)) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:55:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-11-23 23:55:05,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520173649] [2020-11-23 23:55:05,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:55:05,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-11-23 23:55:05,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302009819] [2020-11-23 23:55:05,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-23 23:55:05,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:55:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-23 23:55:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=20, Unknown=9, NotChecked=104, Total=156 [2020-11-23 23:55:05,753 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-11-23 23:55:11,109 WARN L193 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 54 [2020-11-23 23:55:44,599 WARN L193 SmtUtils]: Spent 24.39 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-23 23:55:50,129 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2)))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse4 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse3 .cse4) .cse5)) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse4))) (not (fp.eq .cse5 .cse3)))))) is different from false [2020-11-23 23:55:52,573 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2)))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse4 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse3 .cse4) .cse5)) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse4))) (not (fp.eq .cse5 .cse3)))))) is different from true [2020-11-23 23:55:55,147 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) .cse4) (= (fp.div c_~CRM .cse4 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse2 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5))))) is different from false [2020-11-23 23:55:57,299 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1)) (not (fp.eq .cse1 .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) .cse4) (= (fp.div c_~CRM .cse4 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse2 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5))))) is different from true [2020-11-23 23:55:59,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div c_~CRM .cse4 .cse3) .cse2) (= .cse4 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse1 .cse0))))) is different from false [2020-11-23 23:56:02,204 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse1) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div c_~CRM .cse4 .cse3) .cse2) (= .cse4 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse1 .cse0))))) is different from true [2020-11-23 23:56:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:56:06,223 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-11-23 23:56:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-23 23:56:06,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2020-11-23 23:56:06,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:56:06,230 INFO L225 Difference]: With dead ends: 13 [2020-11-23 23:56:06,230 INFO L226 Difference]: Without dead ends: 10 [2020-11-23 23:56:06,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.8s TimeCoverageRelationStatistics Valid=36, Invalid=33, Unknown=17, NotChecked=220, Total=306 [2020-11-23 23:56:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-11-23 23:56:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-23 23:56:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-23 23:56:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-11-23 23:56:06,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-11-23 23:56:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:56:06,236 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-11-23 23:56:06,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-23 23:56:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-11-23 23:56:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-23 23:56:06,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:56:06,237 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-11-23 23:56:06,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 23:56:06,438 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:56:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:56:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 3 times [2020-11-23 23:56:06,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:56:06,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476132440] [2020-11-23 23:56:06,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-23 23:56:10,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 23:56:10,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 23:56:11,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-23 23:56:11,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:56:19,538 WARN L193 SmtUtils]: Spent 6.33 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:56:21,814 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:56:24,261 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:56:26,915 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= .cse3 (fp.div c_~CRM .cse4 .cse1)) (= .cse4 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:56:30,150 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_23 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_23))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse3 (fp.div c_~CRM .cse4 .cse1)) (= .cse4 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:56:32,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-23 23:56:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-23 23:56:38,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:56:42,350 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-11-23 23:56:44,558 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) .cse0)))))) is different from true [2020-11-23 23:56:46,920 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse0)) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:56:49,392 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse3)) (not (fp.eq .cse2 .cse0)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse0))))) is different from true [2020-11-23 23:56:52,146 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_27 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_27))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse4)) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse4 .cse3)) (not (= (fp.div c_~CRM .cse2 .cse1) .cse3))))) is different from true [2020-11-23 23:56:55,589 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_27 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_28 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_28 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_27))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_28) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_28) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_28))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_28) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_28) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_28))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= .cse1 (fp.div c_~CRM .cse2 .cse3))) (not (= (fp.div c_~CRM .cse1 .cse3) .cse4)) (not (= (fp.div c_~CRM .cse5 .cse3) .cse6)) (fp.eq .cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse6 .cse5)) (not (= .cse2 (fp.div c_~CRM .cse0 .cse3))) (not (= (fp.div c_~CRM .cse4 .cse3) .cse5))))) is different from true [2020-11-23 23:56:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-23 23:56:55,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476132440] [2020-11-23 23:56:55,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:56:55,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-11-23 23:56:55,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488475368] [2020-11-23 23:56:55,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-23 23:56:55,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:56:55,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-23 23:56:55,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=29, Unknown=9, NotChecked=144, Total=210 [2020-11-23 23:56:55,594 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 15 states. [2020-11-23 23:57:01,149 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-23 23:57:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-23 23:57:01,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-23 23:57:01,353 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-11-23 23:57:01,360 INFO L168 Benchmark]: Toolchain (without parser) took 239692.81 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 34.3 MB in the beginning and 48.2 MB in the end (delta: -13.8 MB). Peak memory consumption was 1.9 MB. Max. memory is 16.1 GB. [2020-11-23 23:57:01,361 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 39.8 MB. Free memory was 19.8 MB in the beginning and 19.8 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:57:01,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.57 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 38.9 MB in the end (delta: -5.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-23 23:57:01,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.75 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 37.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 23:57:01,365 INFO L168 Benchmark]: Boogie Preprocessor took 28.73 ms. Allocated memory is still 56.6 MB. Free memory was 37.4 MB in the beginning and 36.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:57:01,366 INFO L168 Benchmark]: RCFGBuilder took 2719.12 ms. Allocated memory is still 56.6 MB. Free memory was 36.2 MB in the beginning and 40.3 MB in the end (delta: -4.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-11-23 23:57:01,367 INFO L168 Benchmark]: TraceAbstraction took 236560.98 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 39.9 MB in the beginning and 48.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-11-23 23:57:01,372 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.18 ms. Allocated memory is still 39.8 MB. Free memory was 19.8 MB in the beginning and 19.8 MB in the end (delta: 27.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.57 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 38.9 MB in the end (delta: -5.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.75 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 37.4 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.73 ms. Allocated memory is still 56.6 MB. Free memory was 37.4 MB in the beginning and 36.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2719.12 ms. Allocated memory is still 56.6 MB. Free memory was 36.2 MB in the beginning and 40.3 MB in the end (delta: -4.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 236560.98 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 39.9 MB in the beginning and 48.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...