./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-cbmc-regression/float21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-cbmc-regression/float21.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 fcc9cdbda1dfb552072e950db05ca157e6d0c3fd ..................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-cbmc-regression/float21.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 fcc9cdbda1dfb552072e950db05ca157e6d0c3fd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 14:11:30,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:11:30,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:11:30,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:11:30,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:11:30,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:11:30,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:11:30,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:11:30,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:11:30,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:11:30,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:11:31,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:11:31,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:11:31,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:11:31,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:11:31,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:11:31,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:11:31,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:11:31,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:11:31,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:11:31,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:11:31,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:11:31,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:11:31,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:11:31,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:11:31,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:11:31,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:11:31,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:11:31,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:11:31,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:11:31,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:11:31,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:11:31,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:11:31,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:11:31,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:11:31,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:11:31,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:11:31,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:11:31,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:11:31,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:11:31,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:11:31,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 14:11:31,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:11:31,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:11:31,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:11:31,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:11:31,138 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:11:31,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:11:31,139 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:11:31,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 14:11:31,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:11:31,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:11:31,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:11:31,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:11:31,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:11:31,143 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:11:31,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:11:31,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:11:31,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:11:31,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:11:31,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:11:31,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:11:31,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:11:31,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:11:31,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:11:31,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:11:31,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:11:31,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 14:11:31,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 14:11:31,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:11:31,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:11:31,154 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 -> fcc9cdbda1dfb552072e950db05ca157e6d0c3fd [2020-12-02 14:11:31,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:11:31,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:11:31,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:11:31,900 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:11:31,902 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:11:31,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cbmc-regression/float21.i [2020-12-02 14:11:32,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d6d76ce/a1164f7c6bb045099b92f84edfbcd68d/FLAGdbab3a6b4 [2020-12-02 14:11:33,201 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:11:33,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i [2020-12-02 14:11:33,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d6d76ce/a1164f7c6bb045099b92f84edfbcd68d/FLAGdbab3a6b4 [2020-12-02 14:11:33,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4d6d76ce/a1164f7c6bb045099b92f84edfbcd68d [2020-12-02 14:11:33,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:11:33,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:11:33,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:11:33,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:11:33,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:11:33,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:11:33" (1/1) ... [2020-12-02 14:11:33,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f77ee7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:33, skipping insertion in model container [2020-12-02 14:11:33,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:11:33" (1/1) ... [2020-12-02 14:11:33,664 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:11:33,793 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:11:34,733 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:847) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1710) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:234) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1400) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1079) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2341) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:704) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2341) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2341) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1568) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1044) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1422) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3209) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2291) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:578) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:201) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-02 14:11:34,740 INFO L168 Benchmark]: Toolchain (without parser) took 1121.81 ms. Allocated memory is still 52.4 MB. Free memory was 27.3 MB in the beginning and 28.6 MB in the end (delta: -1.3 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-12-02 14:11:34,741 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 39.8 MB. Free memory is still 23.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:11:34,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1110.37 ms. Allocated memory is still 52.4 MB. Free memory was 27.1 MB in the beginning and 28.6 MB in the end (delta: -1.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-12-02 14:11:34,744 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 39.8 MB. Free memory is still 23.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1110.37 ms. Allocated memory is still 52.4 MB. Free memory was 27.1 MB in the beginning and 28.6 MB in the end (delta: -1.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:847) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 14:11:38,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:11:38,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:11:38,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:11:38,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:11:38,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:11:38,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:11:38,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:11:38,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:11:38,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:11:38,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:11:38,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:11:38,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:11:38,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:11:38,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:11:38,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:11:38,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:11:38,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:11:38,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:11:38,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:11:38,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:11:38,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:11:38,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:11:38,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:11:38,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:11:38,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:11:38,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:11:38,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:11:38,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:11:38,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:11:38,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:11:38,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:11:38,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:11:38,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:11:38,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:11:38,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:11:38,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:11:38,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:11:38,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:11:38,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:11:38,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:11:38,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 14:11:38,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:11:38,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:11:38,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:11:38,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:11:38,316 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:11:38,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:11:38,317 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:11:38,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:11:38,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:11:38,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:11:38,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:11:38,319 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:11:38,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:11:38,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:11:38,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:11:38,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:11:38,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:11:38,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:11:38,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:11:38,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:11:38,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:11:38,321 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 14:11:38,322 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 14:11:38,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:11:38,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:11:38,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 14:11:38,322 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 -> fcc9cdbda1dfb552072e950db05ca157e6d0c3fd [2020-12-02 14:11:39,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:11:39,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:11:39,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:11:39,161 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:11:39,180 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:11:39,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cbmc-regression/float21.i [2020-12-02 14:11:39,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a654aa07d/7a7b2baf080e49bb8aa67f57945630fb/FLAGd69a55467 [2020-12-02 14:11:40,233 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:11:40,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i [2020-12-02 14:11:40,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a654aa07d/7a7b2baf080e49bb8aa67f57945630fb/FLAGd69a55467 [2020-12-02 14:11:40,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a654aa07d/7a7b2baf080e49bb8aa67f57945630fb [2020-12-02 14:11:40,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:11:40,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:11:40,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:11:40,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:11:40,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:11:40,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:11:40" (1/1) ... [2020-12-02 14:11:40,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6cba98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:40, skipping insertion in model container [2020-12-02 14:11:40,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:11:40" (1/1) ... [2020-12-02 14:11:40,315 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:11:40,389 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:11:41,079 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[40548,40561] [2020-12-02 14:11:41,090 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[40793,40806] [2020-12-02 14:11:41,095 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41044,41057] [2020-12-02 14:11:41,100 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41293,41306] [2020-12-02 14:11:41,101 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41371,41384] [2020-12-02 14:11:41,103 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41469,41482] [2020-12-02 14:11:41,105 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41539,41552] [2020-12-02 14:11:41,106 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41607,41620] [2020-12-02 14:11:41,111 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41705,41718] [2020-12-02 14:11:41,112 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41799,41812] [2020-12-02 14:11:41,117 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41906,41919] [2020-12-02 14:11:41,118 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41974,41987] [2020-12-02 14:11:41,124 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[42220,42233] [2020-12-02 14:11:41,132 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:11:41,151 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 14:11:41,208 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[40548,40561] [2020-12-02 14:11:41,213 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[40793,40806] [2020-12-02 14:11:41,218 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41044,41057] [2020-12-02 14:11:41,225 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41293,41306] [2020-12-02 14:11:41,226 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41371,41384] [2020-12-02 14:11:41,228 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41469,41482] [2020-12-02 14:11:41,231 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41539,41552] [2020-12-02 14:11:41,233 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41607,41620] [2020-12-02 14:11:41,235 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41705,41718] [2020-12-02 14:11:41,236 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41799,41812] [2020-12-02 14:11:41,240 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41906,41919] [2020-12-02 14:11:41,241 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[41974,41987] [2020-12-02 14:11:41,247 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cbmc-regression/float21.i[42220,42233] [2020-12-02 14:11:41,250 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:11:41,711 INFO L217 MainTranslator]: Completed translation [2020-12-02 14:11:41,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41 WrapperNode [2020-12-02 14:11:41,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 14:11:41,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 14:11:41,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 14:11:41,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 14:11:41,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 14:11:41,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 14:11:41,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 14:11:41,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 14:11:41,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... [2020-12-02 14:11:41,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 14:11:41,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 14:11:41,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 14:11:41,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 14:11:41,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:11:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 14:11:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_FLOAT [2020-12-02 14:11:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 14:11:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 14:11:42,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 14:11:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 14:11:51,772 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 14:11:51,773 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 14:11:51,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:11:51 BoogieIcfgContainer [2020-12-02 14:11:51,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 14:11:51,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 14:11:51,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 14:11:51,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 14:11:51,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:11:40" (1/3) ... [2020-12-02 14:11:51,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8cb6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:11:51, skipping insertion in model container [2020-12-02 14:11:51,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:11:41" (2/3) ... [2020-12-02 14:11:51,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8cb6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:11:51, skipping insertion in model container [2020-12-02 14:11:51,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:11:51" (3/3) ... [2020-12-02 14:11:51,804 INFO L111 eAbstractionObserver]: Analyzing ICFG float21.i [2020-12-02 14:11:51,831 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 14:11:51,853 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-12-02 14:11:51,879 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-12-02 14:11:51,959 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 14:11:51,963 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 14:11:51,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 14:11:51,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 14:11:51,964 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 14:11:51,964 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 14:11:51,964 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 14:11:51,964 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 14:11:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-12-02 14:11:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-02 14:11:52,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:11:52,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-02 14:11:52,005 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:11:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:11:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2020-12-02 14:11:52,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:11:52,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822677632] [2020-12-02 14:11:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 14:11:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:11:52,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 14:11:52,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:11:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:11:52,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:11:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:11:52,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822677632] [2020-12-02 14:11:52,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:11:52,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-12-02 14:11:52,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569469987] [2020-12-02 14:11:52,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 14:11:52,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:11:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 14:11:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:11:52,451 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2020-12-02 14:11:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:11:55,873 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2020-12-02 14:11:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 14:11:55,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-02 14:11:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:11:55,934 INFO L225 Difference]: With dead ends: 113 [2020-12-02 14:11:55,934 INFO L226 Difference]: Without dead ends: 53 [2020-12-02 14:11:55,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:11:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-02 14:11:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-02 14:11:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-02 14:11:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2020-12-02 14:11:56,026 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 4 [2020-12-02 14:11:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:11:56,027 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2020-12-02 14:11:56,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 14:11:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2020-12-02 14:11:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-02 14:11:56,030 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:11:56,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:11:56,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 14:11:56,245 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:11:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:11:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1808724044, now seen corresponding path program 1 times [2020-12-02 14:11:56,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:11:56,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936972586] [2020-12-02 14:11:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 14:11:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:11:56,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:11:56,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:11:56,808 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2020-12-02 14:11:57,445 WARN L197 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-12-02 14:11:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:11:57,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:11:57,632 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:11:57,633 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,641 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:11:57,642 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,645 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:11:57,646 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,650 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:11:57,651 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,655 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:11:57,656 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,661 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:11:57,662 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,667 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:11:57,667 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:11:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:11:57,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936972586] [2020-12-02 14:11:57,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:11:57,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-12-02 14:11:57,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780513698] [2020-12-02 14:11:57,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 14:11:57,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:11:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 14:11:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 14:11:57,765 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 8 states. [2020-12-02 14:12:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:12:04,156 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2020-12-02 14:12:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:12:04,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-12-02 14:12:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:12:04,160 INFO L225 Difference]: With dead ends: 53 [2020-12-02 14:12:04,160 INFO L226 Difference]: Without dead ends: 51 [2020-12-02 14:12:04,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-02 14:12:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-02 14:12:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-02 14:12:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-02 14:12:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 50 transitions. [2020-12-02 14:12:04,168 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 50 transitions. Word has length 7 [2020-12-02 14:12:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:12:04,168 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 50 transitions. [2020-12-02 14:12:04,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 14:12:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 50 transitions. [2020-12-02 14:12:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-02 14:12:04,169 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:12:04,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:12:04,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 14:12:04,383 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:12:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:12:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 235874606, now seen corresponding path program 1 times [2020-12-02 14:12:04,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:12:04,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122416773] [2020-12-02 14:12:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 14:12:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:12:04,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 14:12:04,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:12:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:04,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:12:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:04,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122416773] [2020-12-02 14:12:04,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:12:04,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-12-02 14:12:04,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885634166] [2020-12-02 14:12:04,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 14:12:04,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:12:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 14:12:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:12:04,582 INFO L87 Difference]: Start difference. First operand 51 states and 50 transitions. Second operand 4 states. [2020-12-02 14:12:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:12:08,335 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2020-12-02 14:12:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 14:12:08,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-02 14:12:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:12:08,338 INFO L225 Difference]: With dead ends: 51 [2020-12-02 14:12:08,338 INFO L226 Difference]: Without dead ends: 49 [2020-12-02 14:12:08,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:12:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-02 14:12:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-02 14:12:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-02 14:12:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2020-12-02 14:12:08,344 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 8 [2020-12-02 14:12:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:12:08,345 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2020-12-02 14:12:08,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 14:12:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2020-12-02 14:12:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 14:12:08,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:12:08,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:12:08,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 14:12:08,560 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:12:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:12:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 377772985, now seen corresponding path program 1 times [2020-12-02 14:12:08,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:12:08,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828169260] [2020-12-02 14:12:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 14:12:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:12:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:12:08,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:12:09,057 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2020-12-02 14:12:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:09,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:12:11,481 WARN L197 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 14:12:14,685 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 19 [2020-12-02 14:12:14,719 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:12:14,723 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,728 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:12:14,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,731 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:12:14,731 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,732 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:12:14,733 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,736 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:12:14,737 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,739 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:12:14,740 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:14,741 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:12:14,742 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:12:17,242 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-02 14:12:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:17,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828169260] [2020-12-02 14:12:17,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:12:17,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-12-02 14:12:17,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336983952] [2020-12-02 14:12:17,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 14:12:17,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:12:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 14:12:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 14:12:17,321 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 8 states. [2020-12-02 14:12:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:12:30,540 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2020-12-02 14:12:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:12:30,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-12-02 14:12:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:12:30,549 INFO L225 Difference]: With dead ends: 49 [2020-12-02 14:12:30,549 INFO L226 Difference]: Without dead ends: 47 [2020-12-02 14:12:30,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-02 14:12:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-02 14:12:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-02 14:12:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-02 14:12:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2020-12-02 14:12:30,555 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 11 [2020-12-02 14:12:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:12:30,556 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2020-12-02 14:12:30,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 14:12:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2020-12-02 14:12:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 14:12:30,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:12:30,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:12:30,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 14:12:30,760 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:12:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:12:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1173935240, now seen corresponding path program 1 times [2020-12-02 14:12:30,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:12:30,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711170351] [2020-12-02 14:12:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 14:12:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:12:30,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 14:12:30,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:12:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:30,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:12:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:30,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711170351] [2020-12-02 14:12:30,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:12:30,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-12-02 14:12:30,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470571183] [2020-12-02 14:12:30,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 14:12:30,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:12:30,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 14:12:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:12:30,948 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 4 states. [2020-12-02 14:12:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:12:34,354 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2020-12-02 14:12:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 14:12:34,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 14:12:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:12:34,356 INFO L225 Difference]: With dead ends: 47 [2020-12-02 14:12:34,356 INFO L226 Difference]: Without dead ends: 45 [2020-12-02 14:12:34,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:12:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-02 14:12:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-02 14:12:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-02 14:12:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2020-12-02 14:12:34,362 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 12 [2020-12-02 14:12:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:12:34,362 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2020-12-02 14:12:34,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 14:12:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2020-12-02 14:12:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 14:12:34,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:12:34,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:12:34,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 14:12:34,575 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:12:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:12:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1424759098, now seen corresponding path program 1 times [2020-12-02 14:12:34,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:12:34,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842458233] [2020-12-02 14:12:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-02 14:12:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:12:34,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:12:34,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:12:35,178 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-02 14:12:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:35,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:12:39,819 WARN L197 SmtUtils]: Spent 786.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-02 14:12:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:39,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842458233] [2020-12-02 14:12:39,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:12:39,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 14:12:39,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776970661] [2020-12-02 14:12:39,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 14:12:39,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:12:39,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 14:12:39,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 14:12:39,877 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 6 states. [2020-12-02 14:12:42,228 WARN L197 SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-02 14:12:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:12:51,428 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2020-12-02 14:12:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 14:12:51,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 14:12:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:12:51,445 INFO L225 Difference]: With dead ends: 45 [2020-12-02 14:12:51,445 INFO L226 Difference]: Without dead ends: 43 [2020-12-02 14:12:51,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 14:12:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-02 14:12:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-02 14:12:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-02 14:12:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2020-12-02 14:12:51,450 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 14 [2020-12-02 14:12:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:12:51,451 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2020-12-02 14:12:51,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 14:12:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2020-12-02 14:12:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 14:12:51,452 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:12:51,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:12:51,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 14:12:51,656 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:12:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:12:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -900948068, now seen corresponding path program 1 times [2020-12-02 14:12:51,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:12:51,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181666755] [2020-12-02 14:12:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-02 14:12:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:12:51,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-02 14:12:51,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:12:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:52,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:12:53,516 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-02 14:12:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:12:53,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181666755] [2020-12-02 14:12:53,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:12:53,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 14:12:53,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138826014] [2020-12-02 14:12:53,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 14:12:53,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:12:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 14:12:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 14:12:53,560 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 6 states. [2020-12-02 14:12:54,909 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-12-02 14:13:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:13:01,609 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2020-12-02 14:13:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 14:13:01,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 14:13:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:13:01,623 INFO L225 Difference]: With dead ends: 43 [2020-12-02 14:13:01,624 INFO L226 Difference]: Without dead ends: 41 [2020-12-02 14:13:01,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 14:13:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-02 14:13:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-02 14:13:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-02 14:13:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 40 transitions. [2020-12-02 14:13:01,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 40 transitions. Word has length 16 [2020-12-02 14:13:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:13:01,628 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 40 transitions. [2020-12-02 14:13:01,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 14:13:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 40 transitions. [2020-12-02 14:13:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 14:13:01,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:13:01,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:13:01,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-02 14:13:01,834 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:13:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:13:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1772426910, now seen corresponding path program 1 times [2020-12-02 14:13:01,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:13:01,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472675157] [2020-12-02 14:13:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-02 14:13:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:13:01,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-02 14:13:01,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:13:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:02,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:13:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:03,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472675157] [2020-12-02 14:13:03,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:13:03,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 14:13:03,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627121298] [2020-12-02 14:13:03,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 14:13:03,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:13:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 14:13:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 14:13:03,091 INFO L87 Difference]: Start difference. First operand 41 states and 40 transitions. Second operand 6 states. [2020-12-02 14:13:05,387 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-12-02 14:13:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:13:14,294 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2020-12-02 14:13:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 14:13:14,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 14:13:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:13:14,309 INFO L225 Difference]: With dead ends: 41 [2020-12-02 14:13:14,309 INFO L226 Difference]: Without dead ends: 39 [2020-12-02 14:13:14,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 14:13:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-02 14:13:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-12-02 14:13:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-02 14:13:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 38 transitions. [2020-12-02 14:13:14,313 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 38 transitions. Word has length 18 [2020-12-02 14:13:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:13:14,314 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 38 transitions. [2020-12-02 14:13:14,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 14:13:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 38 transitions. [2020-12-02 14:13:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 14:13:14,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:13:14,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:13:14,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-02 14:13:14,530 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:13:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:13:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1799629248, now seen corresponding path program 1 times [2020-12-02 14:13:14,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:13:14,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132700984] [2020-12-02 14:13:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-02 14:13:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:13:14,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:13:14,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:13:15,616 WARN L197 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-02 14:13:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:15,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:13:23,537 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-02 14:13:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:23,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132700984] [2020-12-02 14:13:23,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:13:23,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-12-02 14:13:23,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014915421] [2020-12-02 14:13:23,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 14:13:23,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:13:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 14:13:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2020-12-02 14:13:23,797 INFO L87 Difference]: Start difference. First operand 39 states and 38 transitions. Second operand 7 states. [2020-12-02 14:13:28,242 WARN L197 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-12-02 14:13:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:13:36,521 INFO L93 Difference]: Finished difference Result 39 states and 38 transitions. [2020-12-02 14:13:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:13:36,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-02 14:13:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:13:36,543 INFO L225 Difference]: With dead ends: 39 [2020-12-02 14:13:36,543 INFO L226 Difference]: Without dead ends: 37 [2020-12-02 14:13:36,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2020-12-02 14:13:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-02 14:13:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-02 14:13:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-02 14:13:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2020-12-02 14:13:36,547 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 20 [2020-12-02 14:13:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:13:36,550 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2020-12-02 14:13:36,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 14:13:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2020-12-02 14:13:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 14:13:36,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:13:36,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:13:36,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-02 14:13:36,753 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:13:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:13:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1428240002, now seen corresponding path program 1 times [2020-12-02 14:13:36,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:13:36,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659296321] [2020-12-02 14:13:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-02 14:13:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:13:36,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:13:36,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:13:38,789 WARN L197 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 26 [2020-12-02 14:13:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:38,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:13:45,584 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-02 14:13:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:13:45,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659296321] [2020-12-02 14:13:45,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:13:45,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-12-02 14:13:45,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295125587] [2020-12-02 14:13:45,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 14:13:45,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:13:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 14:13:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2020-12-02 14:13:45,796 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 7 states. [2020-12-02 14:14:01,484 WARN L197 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-12-02 14:14:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:14:11,915 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2020-12-02 14:14:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:14:11,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-12-02 14:14:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:14:11,929 INFO L225 Difference]: With dead ends: 37 [2020-12-02 14:14:11,929 INFO L226 Difference]: Without dead ends: 35 [2020-12-02 14:14:11,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2020-12-02 14:14:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-02 14:14:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-02 14:14:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-02 14:14:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2020-12-02 14:14:11,931 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 22 [2020-12-02 14:14:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:14:11,932 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2020-12-02 14:14:11,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 14:14:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-12-02 14:14:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 14:14:11,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:14:11,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:14:12,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-02 14:14:12,137 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:14:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:14:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1850765468, now seen corresponding path program 1 times [2020-12-02 14:14:12,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:14:12,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433899054] [2020-12-02 14:14:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-02 14:14:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:14:12,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-02 14:14:12,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:14:15,553 WARN L197 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-02 14:14:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:14:15,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:14:18,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet101_19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet103_19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet100_16| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet102_16| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet100_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet100_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet100_16|))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~v~0) ((_ extract 62 52) c_ULTIMATE.start_main_~v~0) ((_ extract 51 0) c_ULTIMATE.start_main_~v~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet102_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet102_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet102_16|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet101_19|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet101_19|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet101_19|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet103_19|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet103_19|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet103_19|)))) (or (not (= .cse0 (fp.sub c_~CRM .cse1 .cse2))) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (fp ((_ extract 31 31) c_ULTIMATE.start_main_~largestSubnormalFloat~0) ((_ extract 30 23) c_ULTIMATE.start_main_~largestSubnormalFloat~0) ((_ extract 22 0) c_ULTIMATE.start_main_~largestSubnormalFloat~0))))) (not (= ((_ to_fp 11 53) c_~CRM (fp ((_ extract 31 31) c_ULTIMATE.start_main_~smallestNormalFloat~0) ((_ extract 30 23) c_ULTIMATE.start_main_~smallestNormalFloat~0) ((_ extract 22 0) c_ULTIMATE.start_main_~smallestNormalFloat~0))) .cse1)) (not (= .cse4 (fp.sub c_~CRM .cse2 .cse3))) (fp.leq .cse0 .cse4)))) is different from false [2020-12-02 14:14:20,380 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet101_19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet103_19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet100_16| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet102_16| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet100_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet100_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet100_16|))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~v~0) ((_ extract 62 52) c_ULTIMATE.start_main_~v~0) ((_ extract 51 0) c_ULTIMATE.start_main_~v~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet102_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet102_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet102_16|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet101_19|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet101_19|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet101_19|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet103_19|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet103_19|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet103_19|)))) (or (not (= .cse0 (fp.sub c_~CRM .cse1 .cse2))) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (fp ((_ extract 31 31) c_ULTIMATE.start_main_~largestSubnormalFloat~0) ((_ extract 30 23) c_ULTIMATE.start_main_~largestSubnormalFloat~0) ((_ extract 22 0) c_ULTIMATE.start_main_~largestSubnormalFloat~0))))) (not (= ((_ to_fp 11 53) c_~CRM (fp ((_ extract 31 31) c_ULTIMATE.start_main_~smallestNormalFloat~0) ((_ extract 30 23) c_ULTIMATE.start_main_~smallestNormalFloat~0) ((_ extract 22 0) c_ULTIMATE.start_main_~smallestNormalFloat~0))) .cse1)) (not (= .cse4 (fp.sub c_~CRM .cse2 .cse3))) (fp.leq .cse0 .cse4)))) is different from true [2020-12-02 14:14:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:14:21,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433899054] [2020-12-02 14:14:21,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:14:21,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-12-02 14:14:21,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357570362] [2020-12-02 14:14:21,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 14:14:21,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:14:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 14:14:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2020-12-02 14:14:21,450 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 7 states. [2020-12-02 14:14:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:14:30,522 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-12-02 14:14:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:14:30,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-02 14:14:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:14:30,539 INFO L225 Difference]: With dead ends: 35 [2020-12-02 14:14:30,539 INFO L226 Difference]: Without dead ends: 33 [2020-12-02 14:14:30,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2020-12-02 14:14:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-02 14:14:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-02 14:14:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-02 14:14:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2020-12-02 14:14:30,545 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 24 [2020-12-02 14:14:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:14:30,546 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2020-12-02 14:14:30,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 14:14:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2020-12-02 14:14:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 14:14:30,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:14:30,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:14:30,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-02 14:14:30,757 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:14:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:14:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash -469026586, now seen corresponding path program 1 times [2020-12-02 14:14:30,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:14:30,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834569589] [2020-12-02 14:14:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-02 14:14:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:14:31,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:14:31,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:14:31,768 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-12-02 14:14:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:14:31,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:14:35,311 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-02 14:14:36,567 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-02 14:14:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:14:36,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834569589] [2020-12-02 14:14:36,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:14:36,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-12-02 14:14:36,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275083852] [2020-12-02 14:14:36,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 14:14:36,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:14:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 14:14:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-02 14:14:36,576 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 8 states. [2020-12-02 14:14:42,550 WARN L197 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-02 14:14:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:14:43,556 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2020-12-02 14:14:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 14:14:43,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-12-02 14:14:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:14:43,569 INFO L225 Difference]: With dead ends: 33 [2020-12-02 14:14:43,569 INFO L226 Difference]: Without dead ends: 31 [2020-12-02 14:14:43,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-02 14:14:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-02 14:14:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-12-02 14:14:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-02 14:14:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2020-12-02 14:14:43,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 26 [2020-12-02 14:14:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:14:43,572 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2020-12-02 14:14:43,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 14:14:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2020-12-02 14:14:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-02 14:14:43,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:14:43,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:14:43,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-02 14:14:43,778 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:14:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:14:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 262991178, now seen corresponding path program 1 times [2020-12-02 14:14:43,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:14:43,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654654337] [2020-12-02 14:14:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-02 14:14:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:14:44,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-02 14:14:44,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:14:44,886 WARN L197 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2020-12-02 14:14:51,137 WARN L197 SmtUtils]: Spent 3.60 s on a formula simplification that was a NOOP. DAG size: 24 [2020-12-02 14:14:57,184 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet107_19| (_ BitVec 32)) (ULTIMATE.start_main_~f~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet106| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet106|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_19|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_19|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_19|))) (.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~f~0) ((_ extract 30 23) ULTIMATE.start_main_~f~0) ((_ extract 22 0) ULTIMATE.start_main_~f~0)))) (and (fp.isSubnormal .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse1) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1) (not (fp.eq .cse2 .cse0))))) is different from false [2020-12-02 14:14:59,196 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet107_19| (_ BitVec 32)) (ULTIMATE.start_main_~f~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet106| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet106|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_19|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_19|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_19|))) (.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~f~0) ((_ extract 30 23) ULTIMATE.start_main_~f~0) ((_ extract 22 0) ULTIMATE.start_main_~f~0)))) (and (fp.isSubnormal .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse1) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1) (not (fp.eq .cse2 .cse0))))) is different from true [2020-12-02 14:14:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:14:59,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:15:14,271 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-02 14:15:16,294 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet107_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet106_18| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet106_18|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_21|))) (.cse2 (fp ((_ extract 31 31) c_ULTIMATE.start_main_~f~0) ((_ extract 30 23) c_ULTIMATE.start_main_~f~0) ((_ extract 22 0) c_ULTIMATE.start_main_~f~0)))) (or (not (= .cse0 ((_ to_fp 8 24) c_~CRM .cse1))) (not (= .cse1 ((_ to_fp 11 53) c_~CRM .cse2))) (fp.eq .cse0 .cse2)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-02 14:15:16,328 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:15:16,329 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,330 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:15:16,330 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,332 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:15:16,333 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,334 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:15:16,335 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,338 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 2, 1] term [2020-12-02 14:15:16,339 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,341 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-02 14:15:16,342 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:16,343 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:15:16,344 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:15:20,200 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet107_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet106_18| (_ BitVec 64)) (v_ULTIMATE.start_main_~f~0_46 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet106_18|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_21|))) (.cse1 (fp ((_ extract 31 31) v_ULTIMATE.start_main_~f~0_46) ((_ extract 30 23) v_ULTIMATE.start_main_~f~0_46) ((_ extract 22 0) v_ULTIMATE.start_main_~f~0_46)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM .cse1))) (fp.isNaN .cse1) (not (fp.isSubnormal .cse1)) (not (= .cse2 ((_ to_fp 8 24) c_~CRM .cse0))) (fp.isInfinite .cse1) (fp.eq .cse2 .cse1) (fp.isNormal .cse1)))) is different from true [2020-12-02 14:15:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:15:20,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654654337] [2020-12-02 14:15:20,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:15:20,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2020-12-02 14:15:20,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303580427] [2020-12-02 14:15:20,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 14:15:20,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:15:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 14:15:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=39, Unknown=8, NotChecked=42, Total=110 [2020-12-02 14:15:20,319 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand 11 states. [2020-12-02 14:15:23,298 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet107_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet106_18| (_ BitVec 64)) (v_ULTIMATE.start_main_~f~0_46 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet106_18|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_21|))) (.cse1 (fp ((_ extract 31 31) v_ULTIMATE.start_main_~f~0_46) ((_ extract 30 23) v_ULTIMATE.start_main_~f~0_46) ((_ extract 22 0) v_ULTIMATE.start_main_~f~0_46)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM .cse1))) (fp.isNaN .cse1) (not (fp.isSubnormal .cse1)) (not (= .cse2 ((_ to_fp 8 24) c_~CRM .cse0))) (fp.isInfinite .cse1) (fp.eq .cse2 .cse1) (fp.isNormal .cse1))))) is different from false [2020-12-02 14:15:35,217 WARN L197 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2020-12-02 14:15:41,764 WARN L197 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-12-02 14:15:45,309 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (fp ((_ extract 31 31) c_ULTIMATE.start_main_~f~0) ((_ extract 30 23) c_ULTIMATE.start_main_~f~0) ((_ extract 22 0) c_ULTIMATE.start_main_~f~0)))) (let ((.cse0 (fp.isSubnormal .cse5))) (and (or (and (not .cse0) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse0 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) .cse0 (exists ((|ULTIMATE.start_main_#t~nondet106| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet106|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet106|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) c_ULTIMATE.start_main_~f~0) ((_ extract 30 23) c_ULTIMATE.start_main_~f~0) ((_ extract 22 0) c_ULTIMATE.start_main_~f~0))) .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse1) (fp ((_ extract 31 31) |c_ULTIMATE.start_main_#t~nondet107|) ((_ extract 30 23) |c_ULTIMATE.start_main_#t~nondet107|) ((_ extract 22 0) |c_ULTIMATE.start_main_#t~nondet107|)))))) (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet107_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet106_18| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet106_18|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet106_18|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet107_21|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet107_21|))) (.cse4 (fp ((_ extract 31 31) c_ULTIMATE.start_main_~f~0) ((_ extract 30 23) c_ULTIMATE.start_main_~f~0) ((_ extract 22 0) c_ULTIMATE.start_main_~f~0)))) (or (not (= .cse2 ((_ to_fp 8 24) c_~CRM .cse3))) (not (= .cse3 ((_ to_fp 11 53) c_~CRM .cse4))) (fp.eq .cse2 .cse4)))) (fp.eq (fp ((_ extract 31 31) |c_ULTIMATE.start_main_#t~nondet107|) ((_ extract 30 23) |c_ULTIMATE.start_main_#t~nondet107|) ((_ extract 22 0) |c_ULTIMATE.start_main_#t~nondet107|)) .cse5)))) is different from false [2020-12-02 14:15:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:15:46,389 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2020-12-02 14:15:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 14:15:46,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-12-02 14:15:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:15:46,390 INFO L225 Difference]: With dead ends: 31 [2020-12-02 14:15:46,390 INFO L226 Difference]: Without dead ends: 0 [2020-12-02 14:15:46,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=36, Invalid=63, Unknown=11, NotChecked=100, Total=210 [2020-12-02 14:15:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-02 14:15:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-02 14:15:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-02 14:15:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-02 14:15:46,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-12-02 14:15:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:15:46,391 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-02 14:15:46,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 14:15:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-02 14:15:46,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-02 14:15:46,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-02 14:15:46,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-02 14:15:46,644 INFO L262 CegarLoopResult]: For program point L2-1(line 391) no Hoare annotation was computed. [2020-12-02 14:15:46,644 INFO L262 CegarLoopResult]: For program point L2-2(lines 2 4) no Hoare annotation was computed. [2020-12-02 14:15:46,644 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 397) no Hoare annotation was computed. [2020-12-02 14:15:46,644 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 387) no Hoare annotation was computed. [2020-12-02 14:15:46,644 INFO L262 CegarLoopResult]: For program point L399(line 399) no Hoare annotation was computed. [2020-12-02 14:15:46,645 INFO L262 CegarLoopResult]: For program point L399-1(line 399) no Hoare annotation was computed. [2020-12-02 14:15:46,645 INFO L262 CegarLoopResult]: For program point L399-3(line 399) no Hoare annotation was computed. [2020-12-02 14:15:46,645 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 402) no Hoare annotation was computed. [2020-12-02 14:15:46,645 INFO L262 CegarLoopResult]: For program point L391(line 391) no Hoare annotation was computed. [2020-12-02 14:15:46,645 INFO L262 CegarLoopResult]: For program point L391-2(lines 379 404) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 392) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-02 14:15:46,646 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point L392-2(line 392) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point L384(line 384) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point L384-1(line 384) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point L384-3(line 384) no Hoare annotation was computed. [2020-12-02 14:15:46,647 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 399) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 391) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point L393(line 393) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point L393-1(line 393) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point L393-3(line 393) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 394) no Hoare annotation was computed. [2020-12-02 14:15:46,648 INFO L262 CegarLoopResult]: For program point L402(line 402) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point L402-1(line 402) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point L402-3(line 402) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point L394(line 394) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point L394-1(line 394) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point L394-3(line 394) no Hoare annotation was computed. [2020-12-02 14:15:46,649 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 393) no Hoare annotation was computed. [2020-12-02 14:15:46,650 INFO L265 CegarLoopResult]: At program point L403(lines 378 404) the Hoare annotation is: true [2020-12-02 14:15:46,650 INFO L262 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2020-12-02 14:15:46,650 INFO L262 CegarLoopResult]: For program point L395-1(line 395) no Hoare annotation was computed. [2020-12-02 14:15:46,650 INFO L262 CegarLoopResult]: For program point L395-3(line 395) no Hoare annotation was computed. [2020-12-02 14:15:46,650 INFO L262 CegarLoopResult]: For program point L387(line 387) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point L387-2(lines 379 404) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 396) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 384) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point L396(line 396) no Hoare annotation was computed. [2020-12-02 14:15:46,651 INFO L262 CegarLoopResult]: For program point L396-1(line 396) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point L396-3(line 396) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point L388(line 388) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point L388-2(line 388) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 395) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point L397(line 397) no Hoare annotation was computed. [2020-12-02 14:15:46,652 INFO L262 CegarLoopResult]: For program point L397-1(line 397) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point L397-3(line 397) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 398) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 388) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point L398-1(line 398) no Hoare annotation was computed. [2020-12-02 14:15:46,653 INFO L262 CegarLoopResult]: For program point L398-3(line 398) no Hoare annotation was computed. [2020-12-02 14:15:46,654 INFO L262 CegarLoopResult]: For program point L2(line 387) no Hoare annotation was computed. [2020-12-02 14:15:46,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:15:46 BoogieIcfgContainer [2020-12-02 14:15:46,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 14:15:46,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 14:15:46,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 14:15:46,664 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 14:15:46,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:11:51" (3/4) ... [2020-12-02 14:15:46,668 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-02 14:15:46,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-12-02 14:15:46,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-02 14:15:46,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-02 14:15:46,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-02 14:15:46,761 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 14:15:46,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 14:15:46,763 INFO L168 Benchmark]: Toolchain (without parser) took 246470.81 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 28.9 MB in the beginning and 15.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,763 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 54.5 MB. Free memory is still 36.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:15:46,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1417.62 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 28.8 MB in the beginning and 25.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.82 ms. Allocated memory is still 73.4 MB. Free memory was 25.0 MB in the beginning and 22.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,764 INFO L168 Benchmark]: Boogie Preprocessor took 74.69 ms. Allocated memory is still 73.4 MB. Free memory was 22.3 MB in the beginning and 20.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,765 INFO L168 Benchmark]: RCFGBuilder took 9856.41 ms. Allocated memory is still 73.4 MB. Free memory was 20.0 MB in the beginning and 32.5 MB in the end (delta: -12.5 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,766 INFO L168 Benchmark]: TraceAbstraction took 234886.10 ms. Allocated memory is still 73.4 MB. Free memory was 31.8 MB in the beginning and 20.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,766 INFO L168 Benchmark]: Witness Printer took 98.13 ms. Allocated memory is still 73.4 MB. Free memory was 20.3 MB in the beginning and 15.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 14:15:46,769 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 54.5 MB. Free memory is still 36.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1417.62 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 28.8 MB in the beginning and 25.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.82 ms. Allocated memory is still 73.4 MB. Free memory was 25.0 MB in the beginning and 22.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.69 ms. Allocated memory is still 73.4 MB. Free memory was 22.3 MB in the beginning and 20.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9856.41 ms. Allocated memory is still 73.4 MB. Free memory was 20.0 MB in the beginning and 32.5 MB in the end (delta: -12.5 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 234886.10 ms. Allocated memory is still 73.4 MB. Free memory was 31.8 MB in the beginning and 20.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Witness Printer took 98.13 ms. Allocated memory is still 73.4 MB. Free memory was 20.3 MB in the beginning and 15.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 387]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 396]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 395]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 391]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 384]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 388]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 402]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 392]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 393]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 394]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 398]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 399]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 397]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 234.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 142.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 336 SDtfs, 501 SDslu, 434 SDs, 0 SdLazy, 378 SolverSat, 12 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 105.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 335 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 115.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 13 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.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 87.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 398 ConstructedInterpolants, 176 QuantifiedInterpolants, 273415 SizeOfPredicates, 54 NumberOfNonLiveVariables, 532 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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! Received shutdown request...