./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dca3295f12b1ef36cf31c463cf879069525072f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dca3295f12b1ef36cf31c463cf879069525072f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:42:21,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:21,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:21,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:21,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:21,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:21,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:21,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:21,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:21,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:21,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:21,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:21,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:21,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:21,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:21,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:21,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:21,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:21,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:21,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:21,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:21,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:21,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:21,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:21,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:21,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:21,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:21,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:21,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:21,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:21,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:21,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:21,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:21,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:21,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:21,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:21,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:21,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:21,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:21,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:21,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:21,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:42:21,657 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:21,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:21,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:21,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:21,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:21,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:21,661 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:21,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:21,661 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:21,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:42:21,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:21,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:21,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:21,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:21,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:21,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:21,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:21,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:42:21,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:21,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:21,665 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2021-08-26 01:42:21,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:21,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:21,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:21,966 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:21,967 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:21,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-08-26 01:42:22,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badecc5ac/eb8a72384f1d4db7b8c9e2c8aa23882e/FLAGc35015ebc [2021-08-26 01:42:22,422 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:22,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-08-26 01:42:22,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badecc5ac/eb8a72384f1d4db7b8c9e2c8aa23882e/FLAGc35015ebc [2021-08-26 01:42:22,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badecc5ac/eb8a72384f1d4db7b8c9e2c8aa23882e [2021-08-26 01:42:22,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:22,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:22,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:22,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:22,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:22,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b158379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22, skipping insertion in model container [2021-08-26 01:42:22,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:22,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:22,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2021-08-26 01:42:22,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:22,619 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:22,649 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2021-08-26 01:42:22,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:22,665 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:22,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22 WrapperNode [2021-08-26 01:42:22,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:22,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:22,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:22,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:22,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:22,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:22,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:22,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:22,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:22,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:22,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:22,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:22,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (1/1) ... [2021-08-26 01:42:22,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:22,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:22,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:42:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:42:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:22,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:42:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:23,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:23,230 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-08-26 01:42:23,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:23 BoogieIcfgContainer [2021-08-26 01:42:23,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:23,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:23,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:23,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:23,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:22" (1/3) ... [2021-08-26 01:42:23,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25baec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:23, skipping insertion in model container [2021-08-26 01:42:23,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:22" (2/3) ... [2021-08-26 01:42:23,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25baec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:23, skipping insertion in model container [2021-08-26 01:42:23,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:23" (3/3) ... [2021-08-26 01:42:23,249 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-08-26 01:42:23,253 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:23,253 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:23,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:23,303 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:23,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:23,317 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2021-08-26 01:42:23,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023350376] [2021-08-26 01:42:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:23,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:23,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023350376] [2021-08-26 01:42:23,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023350376] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:23,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:23,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 01:42:23,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391623496] [2021-08-26 01:42:23,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:23,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:23,490 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:23,504 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2021-08-26 01:42:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:23,511 INFO L225 Difference]: With dead ends: 56 [2021-08-26 01:42:23,511 INFO L226 Difference]: Without dead ends: 26 [2021-08-26 01:42:23,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-26 01:42:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-26 01:42:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2021-08-26 01:42:23,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2021-08-26 01:42:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:23,537 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-08-26 01:42:23,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-08-26 01:42:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:42:23,538 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,538 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:42:23,538 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2021-08-26 01:42:23,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017581785] [2021-08-26 01:42:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:23,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:23,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017581785] [2021-08-26 01:42:23,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017581785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:23,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:23,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:23,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909138220] [2021-08-26 01:42:23,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:23,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:23,645 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:23,696 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2021-08-26 01:42:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:42:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:23,698 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:42:23,698 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:42:23,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:42:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2021-08-26 01:42:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:23,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2021-08-26 01:42:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:23,708 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:23,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 01:42:23,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:42:23,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2021-08-26 01:42:23,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252874467] [2021-08-26 01:42:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:23,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:23,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252874467] [2021-08-26 01:42:23,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252874467] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:23,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:23,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:23,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397569900] [2021-08-26 01:42:23,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:23,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:23,773 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:23,806 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2021-08-26 01:42:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:23,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 01:42:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:23,807 INFO L225 Difference]: With dead ends: 42 [2021-08-26 01:42:23,807 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 01:42:23,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 01:42:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2021-08-26 01:42:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:23,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2021-08-26 01:42:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:23,810 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:23,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 01:42:23,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 01:42:23,812 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2021-08-26 01:42:23,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484404663] [2021-08-26 01:42:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:23,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:23,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484404663] [2021-08-26 01:42:23,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484404663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:23,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:23,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:23,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375669728] [2021-08-26 01:42:23,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:23,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:23,853 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:23,882 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2021-08-26 01:42:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 01:42:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:23,883 INFO L225 Difference]: With dead ends: 44 [2021-08-26 01:42:23,883 INFO L226 Difference]: Without dead ends: 40 [2021-08-26 01:42:23,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-26 01:42:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-08-26 01:42:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:23,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2021-08-26 01:42:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:23,887 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:23,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:23,888 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 01:42:23,888 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2021-08-26 01:42:23,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742578682] [2021-08-26 01:42:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:23,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:23,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742578682] [2021-08-26 01:42:23,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742578682] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:23,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:23,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:23,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8326367] [2021-08-26 01:42:23,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:23,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:23,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:23,920 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:23,947 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2021-08-26 01:42:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 01:42:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:23,948 INFO L225 Difference]: With dead ends: 42 [2021-08-26 01:42:23,948 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 01:42:23,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 01:42:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2021-08-26 01:42:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:23,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2021-08-26 01:42:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:23,951 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:23,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:23,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:23,952 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:23,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 01:42:23,953 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:23,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2021-08-26 01:42:23,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:23,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918972690] [2021-08-26 01:42:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:23,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:23,967 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:42:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:23,992 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:42:23,992 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:42:23,993 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:42:23,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 01:42:23,999 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:42:24,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:42:24 BoogieIcfgContainer [2021-08-26 01:42:24,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:42:24,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:42:24,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:42:24,015 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:42:24,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:23" (3/4) ... [2021-08-26 01:42:24,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:42:24,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:42:24,019 INFO L168 Benchmark]: Toolchain (without parser) took 1572.17 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 42.0 MB in the beginning and 40.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:24,019 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.6 MB in the beginning and 43.6 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:24,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.44 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:24,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.38 ms. Allocated memory is still 60.8 MB. Free memory was 44.0 MB in the beginning and 42.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:24,020 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 40.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:24,021 INFO L168 Benchmark]: RCFGBuilder took 484.92 ms. Allocated memory is still 60.8 MB. Free memory was 40.9 MB in the beginning and 38.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:24,021 INFO L168 Benchmark]: TraceAbstraction took 782.47 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 38.4 MB in the beginning and 40.9 MB in the end (delta: -2.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:24,021 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 88.1 MB. Free memory is still 40.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:24,023 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.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.6 MB in the beginning and 43.6 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 219.44 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: -2.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.38 ms. Allocated memory is still 60.8 MB. Free memory was 44.0 MB in the beginning and 42.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 40.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 484.92 ms. Allocated memory is still 60.8 MB. Free memory was 40.9 MB in the beginning and 38.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 782.47 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 38.4 MB in the beginning and 40.9 MB in the end (delta: -2.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.66 ms. Allocated memory is still 88.1 MB. Free memory is still 40.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 80]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L18] return x != x; [L74] COND TRUE !isnan_double(x) [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x [L80] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 704.3ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 9.2ms, AutomataDifference: 183.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 209 SDtfs, 40 SDslu, 242 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 31.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 17.7ms SsaConstructionTime, 110.7ms SatisfiabilityAnalysisTime, 169.7ms InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-26 01:42:24,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:42:26,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:26,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:26,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:26,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:26,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:26,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:26,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:26,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:26,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:26,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:26,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:26,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:26,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:26,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:26,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:26,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:26,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:26,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:26,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:26,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:26,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:26,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:26,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:26,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:26,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:26,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:26,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:26,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:26,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:26,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:26,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:26,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:26,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:26,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:26,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:26,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:26,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:26,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:26,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:26,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:26,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:42:26,500 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:26,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:26,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:26,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:26,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:26,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:26,503 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:26,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:26,504 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:26,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:26,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:26,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:26,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:26,506 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:26,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:26,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:26,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:26,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:26,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:26,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:26,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:26,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:26,507 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:42:26,507 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:42:26,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:26,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:26,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:42:26,508 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2021-08-26 01:42:26,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:26,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:26,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:26,772 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:26,773 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:26,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-08-26 01:42:26,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a920d873/4cd97b8ed2ce41649b8de656b5641083/FLAG0363ca985 [2021-08-26 01:42:27,186 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:27,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-08-26 01:42:27,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a920d873/4cd97b8ed2ce41649b8de656b5641083/FLAG0363ca985 [2021-08-26 01:42:27,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a920d873/4cd97b8ed2ce41649b8de656b5641083 [2021-08-26 01:42:27,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:27,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:27,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:27,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:27,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:27,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd45d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27, skipping insertion in model container [2021-08-26 01:42:27,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:27,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:27,365 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2021-08-26 01:42:27,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:27,382 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:27,434 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2021-08-26 01:42:27,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:27,445 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:27,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27 WrapperNode [2021-08-26 01:42:27,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:27,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:27,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:27,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:27,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:27,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:27,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:27,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:27,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:27,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:27,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:27,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:27,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (1/1) ... [2021-08-26 01:42:27,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:27,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:27,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-08-26 01:42:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:42:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:42:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:27,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:27,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:27,754 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-08-26 01:42:27,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:27 BoogieIcfgContainer [2021-08-26 01:42:27,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:27,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:27,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:27,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:27,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:27" (1/3) ... [2021-08-26 01:42:27,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583665fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:27, skipping insertion in model container [2021-08-26 01:42:27,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:27" (2/3) ... [2021-08-26 01:42:27,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583665fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:27, skipping insertion in model container [2021-08-26 01:42:27,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:27" (3/3) ... [2021-08-26 01:42:27,771 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-08-26 01:42:27,774 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:27,774 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:27,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:27,817 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:27,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:27,829 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:27,830 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:27,831 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2021-08-26 01:42:27,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:27,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830751628] [2021-08-26 01:42:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:27,846 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:27,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:27,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:27,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:42:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:27,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:42:27,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:28,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:28,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:28,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830751628] [2021-08-26 01:42:28,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830751628] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:28,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:28,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:42:28,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861050641] [2021-08-26 01:42:28,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:28,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:28,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:28,148 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:28,157 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2021-08-26 01:42:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:28,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:28,162 INFO L225 Difference]: With dead ends: 56 [2021-08-26 01:42:28,163 INFO L226 Difference]: Without dead ends: 26 [2021-08-26 01:42:28,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-26 01:42:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-26 01:42:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2021-08-26 01:42:28,182 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2021-08-26 01:42:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:28,182 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-08-26 01:42:28,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-08-26 01:42:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:42:28,183 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:28,183 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:28,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:28,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:28,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2021-08-26 01:42:28,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:28,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148273601] [2021-08-26 01:42:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:28,394 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:28,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:28,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:28,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:42:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:28,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:42:28,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:28,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:28,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:28,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148273601] [2021-08-26 01:42:28,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148273601] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:28,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:28,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:28,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291111387] [2021-08-26 01:42:28,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:28,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:28,641 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:28,736 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2021-08-26 01:42:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:42:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:42:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:28,738 INFO L225 Difference]: With dead ends: 50 [2021-08-26 01:42:28,738 INFO L226 Difference]: Without dead ends: 46 [2021-08-26 01:42:28,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-26 01:42:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2021-08-26 01:42:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:28,742 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2021-08-26 01:42:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:28,743 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:28,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:28,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:28,744 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:28,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:28,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:28,953 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2021-08-26 01:42:28,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:28,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365852096] [2021-08-26 01:42:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:28,954 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:28,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:28,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:42:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:29,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 01:42:29,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:29,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-08-26 01:42:31,278 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= c_ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~lsw~0) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)))) (fp.eq .cse0 .cse0)))) is different from true [2021-08-26 01:42:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:31,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:33,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2021-08-26 01:42:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:33,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:33,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365852096] [2021-08-26 01:42:33,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365852096] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:33,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:33,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-08-26 01:42:33,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021655408] [2021-08-26 01:42:33,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:42:33,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:42:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2021-08-26 01:42:33,790 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:08,665 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-08-26 01:43:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 01:43:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 01:43:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:08,667 INFO L225 Difference]: With dead ends: 78 [2021-08-26 01:43:08,667 INFO L226 Difference]: Without dead ends: 62 [2021-08-26 01:43:08,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 18616.0ms TimeCoverageRelationStatistics Valid=153, Invalid=352, Unknown=5, NotChecked=42, Total=552 [2021-08-26 01:43:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-08-26 01:43:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 26. [2021-08-26 01:43:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-08-26 01:43:08,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2021-08-26 01:43:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:08,688 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-26 01:43:08,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-08-26 01:43:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 01:43:08,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:08,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:08,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:08,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:08,898 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2021-08-26 01:43:08,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:08,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46035767] [2021-08-26 01:43:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:08,899 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:08,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:08,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:43:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:09,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:43:09,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:09,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:09,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:09,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46035767] [2021-08-26 01:43:09,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46035767] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:09,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:09,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:43:09,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161059287] [2021-08-26 01:43:09,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:43:09,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:43:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:43:09,103 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:09,169 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2021-08-26 01:43:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:43:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 01:43:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:09,170 INFO L225 Difference]: With dead ends: 48 [2021-08-26 01:43:09,170 INFO L226 Difference]: Without dead ends: 44 [2021-08-26 01:43:09,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:43:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-26 01:43:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-08-26 01:43:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-08-26 01:43:09,176 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2021-08-26 01:43:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:09,177 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-26 01:43:09,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-08-26 01:43:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:43:09,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:09,179 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:09,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-26 01:43:09,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:09,392 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2021-08-26 01:43:09,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:09,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203311442] [2021-08-26 01:43:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:09,393 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:09,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:43:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:09,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:43:09,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:09,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:09,994 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:09,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203311442] [2021-08-26 01:43:09,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203311442] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:09,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:09,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:43:09,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442094042] [2021-08-26 01:43:09,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:43:09,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:43:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:43:09,996 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:10,036 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-08-26 01:43:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:43:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 01:43:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:10,037 INFO L225 Difference]: With dead ends: 33 [2021-08-26 01:43:10,037 INFO L226 Difference]: Without dead ends: 28 [2021-08-26 01:43:10,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 245.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 01:43:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-26 01:43:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-26 01:43:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-26 01:43:10,044 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2021-08-26 01:43:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:10,044 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-26 01:43:10,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-08-26 01:43:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:43:10,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:10,045 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:10,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:10,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:10,253 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2021-08-26 01:43:10,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:10,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130411895] [2021-08-26 01:43:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:10,254 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:10,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:10,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 01:43:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:10,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:43:10,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:10,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:11,064 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:11,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130411895] [2021-08-26 01:43:11,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130411895] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:11,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:11,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:43:11,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503684115] [2021-08-26 01:43:11,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:43:11,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:43:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:43:11,065 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:13,868 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-08-26 01:43:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:43:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 01:43:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:13,870 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:43:13,870 INFO L226 Difference]: Without dead ends: 32 [2021-08-26 01:43:13,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 512.5ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:43:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-08-26 01:43:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-08-26 01:43:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-08-26 01:43:13,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2021-08-26 01:43:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:13,877 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-26 01:43:13,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-08-26 01:43:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 01:43:13,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:13,878 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:13,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:14,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:14,087 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2021-08-26 01:43:14,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:14,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828548114] [2021-08-26 01:43:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:14,089 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:14,090 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:14,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-26 01:43:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:14,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 01:43:14,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:15,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:15,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:15,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828548114] [2021-08-26 01:43:15,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828548114] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:15,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:15,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:43:15,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593621599] [2021-08-26 01:43:15,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:43:15,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:43:15,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:43:15,516 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:18,167 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-08-26 01:43:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 01:43:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 01:43:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:18,169 INFO L225 Difference]: With dead ends: 70 [2021-08-26 01:43:18,169 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 01:43:18,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 633.3ms TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-08-26 01:43:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 01:43:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2021-08-26 01:43:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-26 01:43:18,175 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2021-08-26 01:43:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:18,175 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-26 01:43:18,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-08-26 01:43:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:43:18,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:18,176 INFO L512 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] [2021-08-26 01:43:18,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:18,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:18,393 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2021-08-26 01:43:18,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:18,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947926329] [2021-08-26 01:43:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:18,394 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:18,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:18,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:18,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-26 01:43:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:18,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:43:18,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:18,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-08-26 01:43:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:18,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:18,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2021-08-26 01:43:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:19,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:19,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947926329] [2021-08-26 01:43:19,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947926329] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:19,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:19,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:43:19,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714049621] [2021-08-26 01:43:19,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:43:19,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:43:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:43:19,264 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:19,676 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-08-26 01:43:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:43:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 01:43:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:19,678 INFO L225 Difference]: With dead ends: 44 [2021-08-26 01:43:19,679 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:43:19,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 407.8ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:43:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:43:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-26 01:43:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-08-26 01:43:19,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2021-08-26 01:43:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:19,683 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-08-26 01:43:19,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2021-08-26 01:43:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:43:19,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:19,684 INFO L512 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] [2021-08-26 01:43:19,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:19,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:19,894 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2021-08-26 01:43:19,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:19,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926022909] [2021-08-26 01:43:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:19,895 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:19,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:19,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-26 01:43:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:20,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:43:20,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:20,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:20,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:20,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926022909] [2021-08-26 01:43:20,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926022909] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:20,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:20,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:43:20,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387033728] [2021-08-26 01:43:20,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:43:20,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:43:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:43:20,240 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:20,289 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-08-26 01:43:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:43:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 01:43:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:20,291 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:43:20,291 INFO L226 Difference]: Without dead ends: 24 [2021-08-26 01:43:20,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:43:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-08-26 01:43:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-08-26 01:43:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2021-08-26 01:43:20,304 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2021-08-26 01:43:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:20,305 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2021-08-26 01:43:20,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2021-08-26 01:43:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 01:43:20,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:20,309 INFO L512 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] [2021-08-26 01:43:20,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:20,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:20,519 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2021-08-26 01:43:20,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:20,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966513280] [2021-08-26 01:43:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:20,520 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:20,521 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:20,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-26 01:43:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:20,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 01:43:20,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:21,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:22,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:22,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966513280] [2021-08-26 01:43:22,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966513280] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:22,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:22,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-08-26 01:43:22,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890402060] [2021-08-26 01:43:22,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:43:22,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:43:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-26 01:43:22,143 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:22,599 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2021-08-26 01:43:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:43:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 01:43:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:22,600 INFO L225 Difference]: With dead ends: 24 [2021-08-26 01:43:22,600 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:43:22,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 674.0ms TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-08-26 01:43:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:43:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:43:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:43:22,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-08-26 01:43:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:22,601 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:43:22,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:43:22,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:43:22,604 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:43:22,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:22,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:22,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:43:22,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:22,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:44:27,344 WARN L207 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 147 DAG size of output: 69 [2021-08-26 01:44:28,681 INFO L857 garLoopResultBuilder]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2021-08-26 01:44:28,681 INFO L853 garLoopResultBuilder]: At program point L31-2(lines 31 36) the Hoare annotation is: (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L31-5(lines 31 36) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L853 garLoopResultBuilder]: At program point L31-6(lines 31 36) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x)) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L31-7(lines 28 53) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L860 garLoopResultBuilder]: At program point L85(lines 65 86) the Hoare annotation is: true [2021-08-26 01:44:28,682 INFO L853 garLoopResultBuilder]: At program point L52(lines 28 53) the Hoare annotation is: (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ULTIMATE.start_fmax_double_~x))) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (let ((.cse0 (let ((.cse3 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse3 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))))) (.cse1 (not (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32))))) (or (and .cse0 .cse1 (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32))) (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)))) (and (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) ULTIMATE.start___fpclassify_double_~lsw~0) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)))) (fp.eq .cse2 .cse2)))) .cse0 .cse1))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:44:28,682 INFO L853 garLoopResultBuilder]: At program point L52-1(lines 28 53) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x)) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= ULTIMATE.start___fpclassify_double_~lsw~0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L44-1(lines 44 52) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2021-08-26 01:44:28,682 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L41(lines 41 52) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L41-1(lines 41 52) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L853 garLoopResultBuilder]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x)) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq |ULTIMATE.start_fmax_double_#res| ULTIMATE.start_main_~x~0) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y))) [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2021-08-26 01:44:28,683 INFO L853 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:28,683 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-08-26 01:44:28,687 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:44:28,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,707 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,708 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:44:28 BoogieIcfgContainer [2021-08-26 01:44:28,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:44:28,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:44:28,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:44:28,715 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:44:28,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:27" (3/4) ... [2021-08-26 01:44:28,718 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:44:28,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-08-26 01:44:28,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 01:44:28,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 01:44:28,768 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:44:28,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:28,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && ~fp.eq~DOUBLE(x, x)) && x == x) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) [2021-08-26 01:44:28,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: msw == v_skolemized_q#valueAsBitvector_7[63:32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x)) && x == x) && (((((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && !(\result == 0bv32)) && (((~bvuge32(msw, 2147483648bv32) && ~bvule32(msw, 2148532223bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || ~bvule32(msw, 2146435071bv32))) || (((~fp.eq~DOUBLE(x, x) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: (msw == v_skolemized_q#valueAsBitvector_5[63:32] && v_skolemized_q#valueAsBitvector_5[31:0] == lsw) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0])))) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result))) && !(\result == 0bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) [2021-08-26 01:44:28,786 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(\result, x)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) [2021-08-26 01:44:28,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) [2021-08-26 01:44:28,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_8[63:32] == msw) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) [2021-08-26 01:44:28,816 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:44:28,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:44:28,817 INFO L168 Benchmark]: Toolchain (without parser) took 121610.49 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 25.8 MB in the beginning and 62.2 MB in the end (delta: -36.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,817 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 30.9 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:44:28,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.70 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.6 MB in the beginning and 41.7 MB in the end (delta: -16.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.92 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 39.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:44:28,818 INFO L168 Benchmark]: Boogie Preprocessor took 18.00 ms. Allocated memory is still 58.7 MB. Free memory was 39.7 MB in the beginning and 38.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,818 INFO L168 Benchmark]: RCFGBuilder took 278.99 ms. Allocated memory is still 58.7 MB. Free memory was 37.9 MB in the beginning and 31.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,818 INFO L168 Benchmark]: TraceAbstraction took 120948.04 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 31.2 MB in the beginning and 66.4 MB in the end (delta: -35.2 MB). Peak memory consumption was 48.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,818 INFO L168 Benchmark]: Witness Printer took 100.97 ms. Allocated memory is still 104.9 MB. Free memory was 66.4 MB in the beginning and 62.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:28,819 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.14 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 30.9 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 237.70 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.6 MB in the beginning and 41.7 MB in the end (delta: -16.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 21.92 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 39.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.00 ms. Allocated memory is still 58.7 MB. Free memory was 39.7 MB in the beginning and 38.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 278.99 ms. Allocated memory is still 58.7 MB. Free memory was 37.9 MB in the beginning and 31.7 MB in the end (delta: 6.2 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 120948.04 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 31.2 MB in the beginning and 66.4 MB in the end (delta: -35.2 MB). Peak memory consumption was 48.4 MB. Max. memory is 16.1 GB. * Witness Printer took 100.97 ms. Allocated memory is still 104.9 MB. Free memory was 66.4 MB in the beginning and 62.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 120876.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 12.1ms, AutomataDifference: 41495.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 65873.2ms, InitialAbstractionConstructionTime: 6.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 268 SDtfs, 626 SDslu, 543 SDs, 0 SdLazy, 369 SolverSat, 52 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 25197.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 21161.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 70.9ms AutomataMinimizationTime, 10 MinimizatonAttempts, 102 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 307 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3182 FormulaSimplificationTreeSizeReduction, 192.9ms HoareSimplificationTime, 7 FomulaSimplificationsInter, 8992 FormulaSimplificationTreeSizeReductionInter, 65673.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 132.5ms SsaConstructionTime, 451.7ms SatisfiabilityAnalysisTime, 9768.4ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 103 QuantifiedInterpolants, 2672 SizeOfPredicates, 70 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2021-08-26 01:44:28,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,831 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,831 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,831 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 18]: Loop Invariant [2021-08-26 01:44:28,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant [2021-08-26 01:44:28,838 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,838 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,838 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,839 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,840 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:28,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,853 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((x == x && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: msw == v_skolemized_q#valueAsBitvector_7[63:32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x)) && x == x) && (((((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && !(\result == 0bv32)) && (((~bvuge32(msw, 2147483648bv32) && ~bvule32(msw, 2148532223bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || ~bvule32(msw, 2146435071bv32))) || (((~fp.eq~DOUBLE(x, x) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: (msw == v_skolemized_q#valueAsBitvector_5[63:32] && v_skolemized_q#valueAsBitvector_5[31:0] == lsw) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0])))) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result))) && !(\result == 0bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 31]: Loop Invariant [2021-08-26 01:44:28,854 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,854 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((x == x && ~fp.eq~DOUBLE(x, x)) && x == x) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 28]: Loop Invariant [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,855 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,856 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,857 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_8[63:32] == msw) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 55]: Loop Invariant [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,858 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,859 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:28,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:28,860 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(\result, x)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) RESULT: Ultimate proved your program to be correct! [2021-08-26 01:44:29,062 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-26 01:44:29,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...