./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cdfpl/square_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cdfpl/square_8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9359a1ca6617de6131ac944004153af0ea740bb1 ............................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cdfpl/square_8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9359a1ca6617de6131ac944004153af0ea740bb1 ...................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-10-24 21:50:55,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 21:50:55,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 21:50:55,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 21:50:55,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 21:50:55,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 21:50:55,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 21:50:55,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 21:50:55,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 21:50:55,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 21:50:55,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 21:50:55,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 21:50:55,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 21:50:55,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 21:50:55,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 21:50:55,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 21:50:55,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 21:50:55,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 21:50:55,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 21:50:55,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 21:50:55,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 21:50:55,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 21:50:55,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 21:50:55,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 21:50:55,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 21:50:55,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 21:50:55,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 21:50:55,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 21:50:55,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 21:50:55,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 21:50:55,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 21:50:55,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 21:50:55,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 21:50:55,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 21:50:55,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 21:50:55,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 21:50:55,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 21:50:55,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 21:50:55,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 21:50:55,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 21:50:55,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 21:50:55,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 21:50:55,907 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 21:50:55,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 21:50:55,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 21:50:55,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 21:50:55,911 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 21:50:55,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 21:50:55,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 21:50:55,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 21:50:55,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 21:50:55,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 21:50:55,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 21:50:55,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 21:50:55,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 21:50:55,914 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 21:50:55,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 21:50:55,914 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 21:50:55,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 21:50:55,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 21:50:55,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 21:50:55,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 21:50:55,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 21:50:55,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 21:50:55,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 21:50:55,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 21:50:55,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 21:50:55,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 21:50:55,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 21:50:55,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 21:50:55,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 21:50:55,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9359a1ca6617de6131ac944004153af0ea740bb1 [2020-10-24 21:50:56,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 21:50:56,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 21:50:56,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 21:50:56,391 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 21:50:56,393 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 21:50:56,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cdfpl/square_8.i [2020-10-24 21:50:56,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9ae7330/08226dc43cc1497aa6d68e73b819f943/FLAG1f47a9500 [2020-10-24 21:50:57,103 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 21:50:57,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cdfpl/square_8.i [2020-10-24 21:50:57,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9ae7330/08226dc43cc1497aa6d68e73b819f943/FLAG1f47a9500 [2020-10-24 21:50:57,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9ae7330/08226dc43cc1497aa6d68e73b819f943 [2020-10-24 21:50:57,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 21:50:57,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 21:50:57,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 21:50:57,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 21:50:57,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 21:50:57,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b0249c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57, skipping insertion in model container [2020-10-24 21:50:57,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 21:50:57,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 21:50:57,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 21:50:57,749 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 21:50:57,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 21:50:57,789 INFO L208 MainTranslator]: Completed translation [2020-10-24 21:50:57,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57 WrapperNode [2020-10-24 21:50:57,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 21:50:57,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 21:50:57,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 21:50:57,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 21:50:57,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 21:50:57,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 21:50:57,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 21:50:57,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 21:50:57,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... [2020-10-24 21:50:57,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 21:50:57,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 21:50:57,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 21:50:57,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 21:50:57,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 21:50:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 21:50:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 21:50:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 21:50:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 21:50:58,213 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 21:50:58,214 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-24 21:50:58,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:50:58 BoogieIcfgContainer [2020-10-24 21:50:58,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 21:50:58,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 21:50:58,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 21:50:58,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 21:50:58,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:50:57" (1/3) ... [2020-10-24 21:50:58,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44158edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:50:58, skipping insertion in model container [2020-10-24 21:50:58,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:50:57" (2/3) ... [2020-10-24 21:50:58,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44158edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:50:58, skipping insertion in model container [2020-10-24 21:50:58,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:50:58" (3/3) ... [2020-10-24 21:50:58,230 INFO L111 eAbstractionObserver]: Analyzing ICFG square_8.i [2020-10-24 21:50:58,247 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 21:50:58,255 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 21:50:58,278 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 21:50:58,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 21:50:58,317 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 21:50:58,317 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 21:50:58,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 21:50:58,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 21:50:58,318 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 21:50:58,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 21:50:58,319 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 21:50:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-10-24 21:50:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 21:50:58,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 21:50:58,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 21:50:58,375 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 21:50:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 21:50:58,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966438, now seen corresponding path program 1 times [2020-10-24 21:50:58,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 21:50:58,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170517788] [2020-10-24 21:50:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 21:50:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 21:50:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 21:50:58,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170517788] [2020-10-24 21:50:58,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 21:50:58,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 21:50:58,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889272558] [2020-10-24 21:50:58,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 21:50:58,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 21:50:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 21:50:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 21:50:58,687 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-10-24 21:50:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 21:50:58,705 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-10-24 21:50:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 21:50:58,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-24 21:50:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 21:50:58,718 INFO L225 Difference]: With dead ends: 21 [2020-10-24 21:50:58,719 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 21:50:58,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 21:50:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 21:50:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 21:50:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 21:50:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-10-24 21:50:58,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-10-24 21:50:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 21:50:58,785 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-10-24 21:50:58,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 21:50:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-10-24 21:50:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 21:50:58,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 21:50:58,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 21:50:58,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 21:50:58,790 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 21:50:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 21:50:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813480, now seen corresponding path program 1 times [2020-10-24 21:50:58,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 21:50:58,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962746569] [2020-10-24 21:50:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 21:50:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 21:50:58,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 21:50:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 21:50:58,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 21:50:58,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 21:50:58,933 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 21:50:58,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 21:50:58,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:50:58 BoogieIcfgContainer [2020-10-24 21:50:58,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 21:50:58,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 21:50:58,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 21:50:58,983 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 21:50:58,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:50:58" (3/4) ... [2020-10-24 21:50:58,988 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 21:50:58,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 21:50:58,994 INFO L168 Benchmark]: Toolchain (without parser) took 1520.70 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.1 MB in the beginning and 29.5 MB in the end (delta: -4.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:58,996 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 48.2 MB. Free memory was 29.9 MB in the beginning and 29.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 21:50:58,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.64 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:59,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 48.2 MB. Free memory was 25.8 MB in the beginning and 24.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:59,001 INFO L168 Benchmark]: Boogie Preprocessor took 24.49 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 23.4 MB in the end (delta: 948.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 21:50:59,004 INFO L168 Benchmark]: RCFGBuilder took 356.14 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.4 MB in the beginning and 35.1 MB in the end (delta: -11.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:59,005 INFO L168 Benchmark]: TraceAbstraction took 762.44 ms. Allocated memory is still 58.7 MB. Free memory was 34.6 MB in the beginning and 30.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:59,009 INFO L168 Benchmark]: Witness Printer took 6.76 ms. Allocated memory is still 58.7 MB. Free memory was 30.0 MB in the beginning and 29.5 MB in the end (delta: 465.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 21:50:59,025 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.40 ms. Allocated memory is still 48.2 MB. Free memory was 29.9 MB in the beginning and 29.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 313.64 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 48.2 MB. Free memory was 25.8 MB in the beginning and 24.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 24.49 ms. Allocated memory is still 48.2 MB. Free memory was 24.4 MB in the beginning and 23.4 MB in the end (delta: 948.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 356.14 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.4 MB in the beginning and 35.1 MB in the end (delta: -11.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 762.44 ms. Allocated memory is still 58.7 MB. Free memory was 34.6 MB in the beginning and 30.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Witness Printer took 6.76 ms. Allocated memory is still 58.7 MB. Free memory was 30.0 MB in the beginning and 29.5 MB in the end (delta: 465.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 28, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L20] float IN = __VERIFIER_nondet_float(); [L15] COND FALSE !(!cond) [L23] float x = IN; [L25-L26] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; [L28] COND TRUE !(result >= 0.0f && result < 1.5f) [L12] COND FALSE !(0) [L12] __assert_fail ("0", "square_8.c", 7, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 21:51:01,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 21:51:01,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 21:51:01,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 21:51:01,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 21:51:01,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 21:51:01,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 21:51:01,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 21:51:01,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 21:51:01,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 21:51:01,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 21:51:01,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 21:51:01,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 21:51:01,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 21:51:01,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 21:51:01,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 21:51:01,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 21:51:01,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 21:51:01,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 21:51:01,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 21:51:01,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 21:51:01,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 21:51:01,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 21:51:01,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 21:51:01,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 21:51:01,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 21:51:01,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 21:51:01,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 21:51:01,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 21:51:01,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 21:51:01,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 21:51:01,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 21:51:01,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 21:51:01,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 21:51:01,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 21:51:01,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 21:51:01,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 21:51:01,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 21:51:01,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 21:51:01,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 21:51:01,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 21:51:01,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 21:51:01,948 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 21:51:01,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 21:51:01,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 21:51:01,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 21:51:01,955 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 21:51:01,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 21:51:01,955 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 21:51:01,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 21:51:01,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 21:51:01,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 21:51:01,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 21:51:01,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 21:51:01,958 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 21:51:01,958 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 21:51:01,959 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 21:51:01,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 21:51:01,959 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 21:51:01,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 21:51:01,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 21:51:01,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 21:51:01,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 21:51:01,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 21:51:01,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 21:51:01,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 21:51:01,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 21:51:01,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 21:51:01,962 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 21:51:01,962 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 21:51:01,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 21:51:01,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 21:51:01,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 21:51:01,963 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9359a1ca6617de6131ac944004153af0ea740bb1 [2020-10-24 21:51:02,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 21:51:02,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 21:51:02,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 21:51:02,419 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 21:51:02,420 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 21:51:02,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cdfpl/square_8.i [2020-10-24 21:51:02,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe1bc62/b129d6922daf4639b108e13ccd49c4ca/FLAG682752f6c [2020-10-24 21:51:03,210 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 21:51:03,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cdfpl/square_8.i [2020-10-24 21:51:03,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe1bc62/b129d6922daf4639b108e13ccd49c4ca/FLAG682752f6c [2020-10-24 21:51:03,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fe1bc62/b129d6922daf4639b108e13ccd49c4ca [2020-10-24 21:51:03,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 21:51:03,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 21:51:03,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 21:51:03,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 21:51:03,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 21:51:03,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:03,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3823c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03, skipping insertion in model container [2020-10-24 21:51:03,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:03,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 21:51:03,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 21:51:03,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 21:51:03,888 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 21:51:03,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 21:51:03,936 INFO L208 MainTranslator]: Completed translation [2020-10-24 21:51:03,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03 WrapperNode [2020-10-24 21:51:03,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 21:51:03,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 21:51:03,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 21:51:03,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 21:51:03,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:03,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:03,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 21:51:03,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 21:51:03,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 21:51:03,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 21:51:03,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:03,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... [2020-10-24 21:51:04,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 21:51:04,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 21:51:04,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 21:51:04,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 21:51:04,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 21:51:04,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 21:51:04,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 21:51:04,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 21:51:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 21:51:06,449 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 21:51:06,449 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-24 21:51:06,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:51:06 BoogieIcfgContainer [2020-10-24 21:51:06,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 21:51:06,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 21:51:06,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 21:51:06,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 21:51:06,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:51:03" (1/3) ... [2020-10-24 21:51:06,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a2de1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:51:06, skipping insertion in model container [2020-10-24 21:51:06,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:51:03" (2/3) ... [2020-10-24 21:51:06,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a2de1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:51:06, skipping insertion in model container [2020-10-24 21:51:06,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:51:06" (3/3) ... [2020-10-24 21:51:06,462 INFO L111 eAbstractionObserver]: Analyzing ICFG square_8.i [2020-10-24 21:51:06,473 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 21:51:06,479 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 21:51:06,495 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 21:51:06,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 21:51:06,525 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 21:51:06,526 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 21:51:06,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 21:51:06,526 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 21:51:06,526 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 21:51:06,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 21:51:06,527 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 21:51:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-10-24 21:51:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 21:51:06,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 21:51:06,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 21:51:06,548 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 21:51:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 21:51:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966438, now seen corresponding path program 1 times [2020-10-24 21:51:06,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 21:51:06,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466018359] [2020-10-24 21:51:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 21:51:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 21:51:07,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 21:51:07,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 21:51:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 21:51:07,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 21:51:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 21:51:07,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466018359] [2020-10-24 21:51:07,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 21:51:07,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 21:51:07,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170725229] [2020-10-24 21:51:07,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 21:51:07,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 21:51:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 21:51:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 21:51:07,493 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-10-24 21:51:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 21:51:07,509 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-10-24 21:51:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 21:51:07,511 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-24 21:51:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 21:51:07,525 INFO L225 Difference]: With dead ends: 21 [2020-10-24 21:51:07,526 INFO L226 Difference]: Without dead ends: 8 [2020-10-24 21:51:07,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 21:51:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-10-24 21:51:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-24 21:51:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-24 21:51:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-10-24 21:51:07,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-10-24 21:51:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 21:51:07,566 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-10-24 21:51:07,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 21:51:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-10-24 21:51:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-24 21:51:07,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 21:51:07,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-24 21:51:07,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 21:51:07,788 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 21:51:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 21:51:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813480, now seen corresponding path program 1 times [2020-10-24 21:51:07,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 21:51:07,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791845167] [2020-10-24 21:51:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 21:51:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 21:51:57,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-24 21:51:57,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 21:51:57,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 21:51:59,563 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24)) (= c_ULTIMATE.start_main_~result~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-10-24 21:52:01,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 21:52:12,186 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (_ +zero 8 24))) (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24))))) (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.lt ULTIMATE.start_main_~IN~0 .cse1) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24)))))) is different from false [2020-10-24 21:52:14,290 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (_ +zero 8 24))) (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24))))) (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.lt ULTIMATE.start_main_~IN~0 .cse1) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24)))))) is different from true [2020-10-24 21:52:24,843 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (_ +zero 8 24))) (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) v_prenex_1) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) v_prenex_1) v_prenex_1) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) v_prenex_1) v_prenex_1) v_prenex_1) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.lt v_prenex_1 .cse1) (fp.geq v_prenex_1 (_ +zero 8 24)))))) is different from false [2020-10-24 21:52:26,939 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (_ +zero 8 24))) (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24))))) (exists ((v_prenex_1 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) v_prenex_1) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) v_prenex_1) v_prenex_1) v_prenex_1)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) v_prenex_1) v_prenex_1) v_prenex_1) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.lt v_prenex_1 .cse1) (fp.geq v_prenex_1 (_ +zero 8 24)))))) is different from true [2020-10-24 21:52:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 21:52:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 21:52:29,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) is different from false [2020-10-24 21:52:31,206 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) is different from true [2020-10-24 21:52:33,333 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-10-24 21:52:35,433 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 21:52:35,456 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 21:52:35,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 21:52:35,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-24 21:52:37,551 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (_ +zero 8 24)) (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse0))))) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse1)) (fp.lt (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))))) is different from false [2020-10-24 21:52:39,742 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (_ +zero 8 24)) (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse0))))) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse1)) (fp.lt (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))))) is different from true [2020-10-24 21:52:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 21:52:39,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791845167] [2020-10-24 21:52:39,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 21:52:39,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 11 [2020-10-24 21:52:39,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805720674] [2020-10-24 21:52:39,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 21:52:39,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 21:52:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 21:52:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=20, Unknown=11, NotChecked=78, Total=132 [2020-10-24 21:52:39,749 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 12 states. [2020-10-24 21:52:41,867 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (_ +zero 8 24)) (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse0))))) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse1)) (fp.lt (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))))) is different from false [2020-10-24 21:52:44,050 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (_ +zero 8 24)) (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse0))))) (forall ((v_ULTIMATE.start_main_~IN~0_5 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~IN~0_5 (_ +zero 8 24))) (not (fp.lt v_ULTIMATE.start_main_~IN~0_5 .cse1)) (fp.lt (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5) v_ULTIMATE.start_main_~IN~0_5)) ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))))) is different from true [2020-10-24 21:52:46,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse4 (fp.lt c_ULTIMATE.start_main_~IN~0 .cse1)) (.cse3 (fp.geq c_ULTIMATE.start_main_~IN~0 (_ +zero 8 24)))) (or (and .cse2 (or (not .cse3) (not .cse4))) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse4 .cse3))))) is different from false [2020-10-24 21:52:48,258 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.lt .cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse4 (fp.lt c_ULTIMATE.start_main_~IN~0 .cse1)) (.cse3 (fp.geq c_ULTIMATE.start_main_~IN~0 (_ +zero 8 24)))) (or (and .cse2 (or (not .cse3) (not .cse4))) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse4 .cse3))))) is different from true [2020-10-24 21:52:50,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~IN~0 .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.geq c_ULTIMATE.start_main_~IN~0 (_ +zero 8 24)) (fp.lt .cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0)))))) is different from false [2020-10-24 21:52:52,466 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0) c_ULTIMATE.start_main_~IN~0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~IN~0 .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.geq c_ULTIMATE.start_main_~IN~0 (_ +zero 8 24)) (fp.lt .cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0)))))) is different from true [2020-10-24 21:52:54,561 WARN L838 $PredicateComparison]: unable to prove that (and (fp.lt c_ULTIMATE.start_main_~result~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0))) (exists ((ULTIMATE.start_main_~IN~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt ULTIMATE.start_main_~IN~0 .cse0) (fp.geq ULTIMATE.start_main_~IN~0 (_ +zero 8 24)) (= c_ULTIMATE.start_main_~result~0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0) ULTIMATE.start_main_~IN~0)))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~result~0 (_ +zero 8 24))) is different from false [2020-10-24 21:52:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 21:52:54,570 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-10-24 21:52:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 21:52:54,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2020-10-24 21:52:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 21:52:54,571 INFO L225 Difference]: With dead ends: 8 [2020-10-24 21:52:54,571 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 21:52:54,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=31, Invalid=21, Unknown=18, NotChecked=170, Total=240 [2020-10-24 21:52:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 21:52:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 21:52:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 21:52:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 21:52:54,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-10-24 21:52:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 21:52:54,574 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 21:52:54,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 21:52:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 21:52:54,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 21:52:54,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 21:52:54,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 21:52:54,826 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 21:52:54,826 INFO L277 CegarLoopResult]: At program point L31(lines 18 32) the Hoare annotation is: true [2020-10-24 21:52:54,826 INFO L274 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-10-24 21:52:54,826 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 21:52:54,826 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 21:52:54,827 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 21:52:54,827 INFO L274 CegarLoopResult]: For program point L28(lines 28 29) no Hoare annotation was computed. [2020-10-24 21:52:54,827 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2020-10-24 21:52:54,828 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-10-24 21:52:54,828 INFO L274 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-10-24 21:52:54,828 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-24 21:52:54,828 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-10-24 21:52:54,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:52:54 BoogieIcfgContainer [2020-10-24 21:52:54,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 21:52:54,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 21:52:54,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 21:52:54,843 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 21:52:54,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:51:06" (3/4) ... [2020-10-24 21:52:54,848 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 21:52:54,866 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-24 21:52:54,867 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-24 21:52:54,867 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 21:52:54,868 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 21:52:54,941 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 21:52:54,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 21:52:54,945 INFO L168 Benchmark]: Toolchain (without parser) took 111345.71 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 17.1 MB in the beginning and 29.7 MB in the end (delta: -12.7 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,946 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 39.8 MB. Free memory was 26.3 MB in the beginning and 26.3 MB in the end (delta: 21.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 21:52:54,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.4 MB in the beginning and 23.8 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.64 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,949 INFO L168 Benchmark]: Boogie Preprocessor took 32.92 ms. Allocated memory is still 48.2 MB. Free memory was 22.3 MB in the beginning and 21.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 21:52:54,950 INFO L168 Benchmark]: RCFGBuilder took 2431.16 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 22.4 MB in the end (delta: -1.2 MB). Peak memory consumption was 2.7 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,953 INFO L168 Benchmark]: TraceAbstraction took 108386.96 ms. Allocated memory is still 48.2 MB. Free memory was 22.0 MB in the beginning and 17.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,958 INFO L168 Benchmark]: Witness Printer took 99.51 ms. Allocated memory is still 48.2 MB. Free memory was 17.1 MB in the beginning and 29.7 MB in the end (delta: -12.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 21:52:54,965 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.46 ms. Allocated memory is still 39.8 MB. Free memory was 26.3 MB in the beginning and 26.3 MB in the end (delta: 21.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 327.93 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.4 MB in the beginning and 23.8 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.64 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.92 ms. Allocated memory is still 48.2 MB. Free memory was 22.3 MB in the beginning and 21.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2431.16 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 22.4 MB in the end (delta: -1.2 MB). Peak memory consumption was 2.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 108386.96 ms. Allocated memory is still 48.2 MB. Free memory was 22.0 MB in the beginning and 17.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. * Witness Printer took 99.51 ms. Allocated memory is still 48.2 MB. Free memory was 17.1 MB in the beginning and 29.7 MB in the end (delta: -12.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 108.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 50.0s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 4 QuantifiedInterpolants, 4656 SizeOfPredicates, 6 NumberOfNonLiveVariables, 54 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...